scientific article; zbMATH DE number 3432294

zbMath0275.05110MaRDI QIDQ5183522

Gary Chartrand, Seymour Schuster

Publication date: 1974

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Line domination in graphs ⋮ Some parameters of graph and its complement ⋮ On the product of upper irredundance numbers of a graph and its complement ⋮ Unnamed Item ⋮ Nordhaus-Gaddum type result for the matching number of a graph ⋮ On vertex independence number of uniform hypergraphs ⋮ Total double Roman domination numbers in digraphs ⋮ Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph ⋮ Cops that surround a robber ⋮ New Nordhaus-Gaddum-type results for the Kirchhoff index ⋮ Some results on the independence number of connected domination critical graphs ⋮ Unnamed Item ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ A greedy partition lemma for directed domination ⋮ On total matching numbers and total covering numbers of complementary graphs ⋮ On complementary graphs with no isolated vertices ⋮ Unnamed Item ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph ⋮ Relations between parameters of a graph