scientific article; zbMATH DE number 3335815

zbMath0211.56702MaRDI QIDQ5613121

Gary Chartrand, John Mitchem

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Bidegree of graph and degeneracy number ⋮ Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates ⋮ Unnamed Item ⋮ A Nordhaus-Gaddum-type result for the induced path number ⋮ Super dominating sets in graphs ⋮ Inequalities for the chromatic numbers of graphs ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Nordhaus-Gaddum bounds for total domination ⋮ Graph colourings and partitions ⋮ Unnamed Item ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers ⋮ Graph factorization and theorems of the Nordhaus-Gaddum class ⋮ Relations between parameters of a graph ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars