On maximally saturated graphs

DOI10.1016/0012-365X(82)90200-XzbMath0495.05023WikidataQ56267163 ScholiaQ56267163MaRDI QIDQ1169471

George A. jun. Novacky, Chong-Yun Chao

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialTuran graphchromatically unique graphmultipartite complete graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Chromaticity of the complements of paths and cycles, Some problems on chromatic polynomials, A bibliography on chromatic polynomials, Two classes of chromatically unique graphs, The chromatic uniqueness of certain complete \(t\)-partite graphs., Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs, Chromatic equivalence classes of complete tripartite graphs, The chromatic uniqueness of complete bipartite graphs, A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs, The chromatic equivalence class of \(K_{1, n, n + 2}\), Chromatic uniqueness of atoms in lattices of complete multipartite graphs, The search for chromatically unique graphs

Cites Work

• Chromatic polynomials for regular graphs and modified wheels
• Chromatically unique graphs
• Parallel concepts in graph theory
• On chromatic equivalence of graphs
• An introduction to chromatic polynomials
• On the theory of graphs