The number of shortest cycles and the chromatic uniqueness of a graph

DOI10.1002/jgt.3190160103zbMath0770.05064OpenAlexW2088664728MaRDI QIDQ3990870

Khee Meng Koh, C. P. Teo

Publication date: 28 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160103

zbMATH Keywords

upper boundextremal graphs2-connected graphshortest cycleschromatic uniquenes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ Unnamed Item ⋮ The chromatic equivalence class of \(K_{1, n, n + 2}\) ⋮ Bipartite Perfect Matching is in Quasi-NC ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ Kissing numbers of regular graphs ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces ⋮ On chromatic uniqueness of uniform subdivisions of graphs

This page was built for publication: The number of shortest cycles and the chromatic uniqueness of a graph