Infinite versus finite graph domination

DOI10.1016/J.DISC.2009.11.007MaRDI QIDQ968422zbMATH OpenOpenAlexFDO

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

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

dominating setinfinite graphstructural domination

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

• Infinite graphs with finite dominating sets
• Domination games on infinite graphs
• Intersection graph of a module

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968422)