scientific article; zbMATH DE number 5237312

zbMath1134.05070MaRDI QIDQ5443247

Douglas B. West, Ermelinda DeLaViña, Qi Liu, Ryan Pepper, Bill Waller

Publication date: 20 February 2008

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

zbMATH Keywords

independencematchingchromatic numberclique numberpath covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Bounds on domination parameters in graphs: a brief survey ⋮ Matchings, path covers and domination ⋮ A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture ⋮ The minimum spectral radius of graphs with a given domination number ⋮ On domination number and distance in graphs ⋮ On matching and semitotal domination in graphs ⋮ Domination, radius, and minimum degree ⋮ A survey of selected recent results on total domination in graphs ⋮ Matching, path covers, and total forcing sets ⋮ Paired Domination in Graphs ⋮ A note on dominating sets and average distance

Uses Software

• Graffiti.pc