Graph factorization and theorems of the Nordhaus-Gaddum class
From MaRDI portal
Publication:802576
Recommendations
Cites work
- scientific article; zbMATH DE number 3477220 (Why is no real title available?)
- scientific article; zbMATH DE number 3335815 (Why is no real title available?)
- scientific article; zbMATH DE number 3338394 (Why is no real title available?)
- k-Degenerate Graphs
- Bounds on chromatic numbers of multiple factors of a complete graph
- Complementary Graphs and Edge Chromatic Numbers
- Complementary Graphs and Total Chromatic Numbers
- Graph Union and Chromatic Number†
- On Complementary Graphs
Cited in
(7)- Point partition numbers and generalized Nordhaus-Gaddum problems
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
- The connectivity of a bipartite graph and its bipartite complementary graph
- scientific article; zbMATH DE number 5663233 (Why is no real title available?)
- scientific article; zbMATH DE number 3941567 (Why is no real title available?)
- Chromatic factorizations of a graph
This page was built for publication: Graph factorization and theorems of the Nordhaus-Gaddum class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802576)