Log-concavity of the genus polynomials for a sequence of cubic Halin graphs

Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker

Research output: Contribution to journalArticlepeer-review


A Halin graph is a graph obtained from a plane tree by running a cycle through its leaf vertices in the order they are encountered along a counterclockwise pre-order traversal. Using a vectorized production matrix, we give a matrix formula for the partitioned genus polynomial of any cubic Halin graph and for the genus polynomial as well. We prove log-concavity of the genus polynomial and of the partitioned genus polynomials for several sequences of cubic Halin graphs, which serves as further support of the conjecture that the genus polynomial of every graph is log-concave.
Original languageEnglish
Pages (from-to)203-233
Number of pages31
JournalJournal of Combinatorics
Issue number2
StatePublished - 2014


Dive into the research topics of 'Log-concavity of the genus polynomials for a sequence of cubic Halin graphs'. Together they form a unique fingerprint.

Cite this