Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs
Ioan Tomescu (2001)
Matematički Vesnik
Similarity:
Displaying similar documents to “Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems.”
Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs
The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.
Hagos, Elias M. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The linear complexity of a graph.
Neel, David L., Orrison, Michael E. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The permanent of the Laplacian matrix of a bipartite graph
Antonín Vrba (1986)
Czechoslovak Mathematical Journal
Similarity:
Operations on well-covered graphs and the Roller-Coaster conjecture.
Matchett, Philip (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Sagnik Sen (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Graphs which have pancyclic complements.
Straight, H.Joseph (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Voltage graphs, group presentations and cages.
Exoo, Geoffrey (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Problems in algebraic combinatorics.
Godsil, C.D. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Characterization of a signed graph whose signed line graph is -consistent.
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity: