Graph factorization and theorems of the Nordhaus-Gaddum class

DOI10.1007/BF01850724zbMATH Open0559.05045MaRDI QIDQ802576FDOQ802576

Authors: N. E. Zubov 

Publication date: 1984

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

Recommendations

• scientific article; zbMATH DE number 3941567
• scientific article; zbMATH DE number 3896958
• Point partition numbers and generalized Nordhaus-Gaddum problems
• scientific article; zbMATH DE number 500499
• Complementary graphs and the chromatic number

zbMATH Keywords

chromatic numbergraph factorizationNordhaus-Gaddum theoremline connectivitypoint partition numbers

Mathematics Subject Classification ID

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

Cites Work

• k-Degenerate Graphs
• On Complementary Graphs
• Title not available (Why is that?)
• Bounds on chromatic numbers of multiple factors of a complete graph
• Complementary Graphs and Total Chromatic Numbers
• Complementary Graphs and Edge Chromatic Numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Union and Chromatic Number†

Cited In (7)

• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
• Point partition numbers and generalized Nordhaus-Gaddum problems
• Title not available (Why is that?)
• Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
• Title not available (Why is that?)
• The connectivity of a bipartite graph and its bipartite complementary graph
• 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)