scientific article; zbMATH DE number 1247724

zbMath0913.90257MaRDI QIDQ4227911

Gábor Bacsó, Zsolt Tuza

Publication date: 2 February 1999

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

zbMATH Keywords

dominating setundirected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Related Items (11)

Dominating subgraphs in graphs with some forbidden structures ⋮ Characterization of graphs dominated by induced paths ⋮ Characterization of \(P_{6}\)-free graphs ⋮ A New Characterization of P 6-Free Graphs ⋮ On partitioning a graph into two connected subgraphs ⋮ Infinite versus finite graph domination ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ Partitioning Graphs into Connected Parts ⋮ Complete description of forbidden subgraphs in the structural domination problem ⋮ Partitioning graphs into connected parts ⋮ On connected dominating sets of restricted diameter

This page was built for publication: