A survey of minimum saturated graphs.
Faudree, Jill R., Faudree, Ralph J., Schmitt, John R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Broken-cycle-free subgraphs and the log-concavity conjecture for chromatic polynomials.”
A survey of minimum saturated graphs.
Graphs with chromatic roots in the interval .
Royle, Gordon F. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Certificates of factorisation for chromatic polynomials.
Morgan, Kerri, Farr, Graham (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic number for a generalization of Cartesian product graphs.
Král', Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Precoloring extension. II. Graphs classes related to bipartite graphs.
Hujter, M., Tuza, Zs. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On the Erdős-Gyárfás Conjecture in Claw-Free Graphs
Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi, Khodakhast Bibak (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs
On the absolute sum of chromatic polynomial coefficient of graphs.
Chen, Shubo (2011)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Circular chromatic number of planar graphs of large odd girth.
Zhu, Xuding (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Acyclic chromatic index and linear arboricity of graphs
Filip Guldan (1991)
Mathematica Slovaca
Similarity: