scientific article; zbMATH DE number 817208

zbMath0836.05065MaRDI QIDQ4854634

Douglas F. Rall, Bert L. Hartnell

Publication date: 22 April 1996

Full work available at URL: https://eudml.org/doc/31473

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

zbMATH Keywords

treeindependencecharacterizationdominating setpolynomial timeneighborhooddomination numbervertex coverleafstemvertex cover number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Vertex covers and eternal dominating sets ⋮ Star-uniform graphs ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ Graphs with equal eternal vertex cover and eternal domination numbers ⋮ A characterization of trees having a minimum vertex cover which is also a minimum total dominating set ⋮ Graphs with equal domination and covering numbers ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ Characterization of graphs with equal domination and covering number ⋮ Bipartization of graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: