Graph factorization and theorems of the Nordhaus-Gaddum class

DOI10.1007/BF01850724zbMath0559.05045MaRDI QIDQ802576

N. E. Zubov

Publication date: 1984

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

chromatic numbergraph factorizationNordhaus-Gaddum theoremline connectivitypoint partition numbers

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Connectivity (05C40)

Related Items (1)

Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers

Cites Work

• On Complementary Graphs
• Complementary Graphs and Total Chromatic Numbers
• Bounds on chromatic numbers of multiple factors of a complete graph
• Graph Union and Chromatic Number†
• k-Degenerate Graphs
• Complementary Graphs and Edge Chromatic Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph factorization and theorems of the Nordhaus-Gaddum class