Complementary graphs and the chromatic number
From MaRDI portal
Publication:2425356
zbMATH Open1145.05309MaRDI QIDQ2425356FDOQ2425356
Authors: Colin Starr, Galen E. III Turner
Publication date: 29 April 2008
Published in: Missouri Journal of Mathematical Sciences (Search for Journal in Brave)
Recommendations
Cited In (15)
- Extremal graphs in some coloring problems
- Title not available (Why is that?)
- Graph factorization and theorems of the Nordhaus-Gaddum class
- Split graphs and Nordhaus-Gaddum graphs
- Title not available (Why is that?)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- Title not available (Why is that?)
- Combinatorial Relations and Chromatic Graphs
- New results on upper bounds for the chromatic number of fuzzy graphs and their complements
- Split graphs and block representations
- The connectivity of a bipartite graph and its bipartite complementary graph
- Operations on independence numbers of certain graph classes
- A survey of Nordhaus-Gaddum type relations
- Title not available (Why is that?)
- Extremal decompositions for Nordhaus-Gaddum theorems
This page was built for publication: Complementary graphs and the chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425356)