Infinite versus finite graph domination

DOI10.1016/j.disc.2009.11.007zbMath1219.05110OpenAlexW1967462701MaRDI QIDQ968422

Heinz A. Jung, Zsolt Tuza, Gábor Bacsó

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.007

zbMATH Keywords

infinite graphdominating setstructural domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63)

Related Items (2)

Infinite graphs with finite dominating sets ⋮ INTERSECTION GRAPH OF A MODULE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Complete description of forbidden subgraphs in the structural domination problem
• On the existence of two non-neighboring subgraphs in a graph
• Maximum induced trees in graphs
• Dominating cliques in \(P_ 5\)-free graphs
• On a class of posets and the corresponding comparability graphs
• On \(m\)-centers in \(P_ t\)-free graphs
• Dominating subgraphs in graphs with some forbidden structures
• On a property of the class of n-colorable graphs
• A characterization of graphs without long induced paths
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• The Comparability Graph of a Tree
• Dominating sets with small clique covering number
• Some results on graphs without long induced paths
• Graph Domination in Distance Two
• Dominating cliques in graphs

This page was built for publication: Infinite versus finite graph domination