Infinite versus finite graph domination
From MaRDI portal
Publication:968422
DOI10.1016/J.DISC.2009.11.007zbMATH Open1219.05110OpenAlexW1967462701MaRDI QIDQ968422FDOQ968422
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Comparability Graph of a Tree
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Dominating cliques in \(P_ 5\)-free graphs
- Maximum induced trees in graphs
- Dominating subgraphs in graphs with some forbidden structures
- On a class of posets and the corresponding comparability graphs
- Some results on graphs without long induced paths
- On a property of the class of n-colorable graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Graph Domination in Distance Two
- A characterization of graphs without long induced paths
- Dominating cliques in graphs
- On \(m\)-centers in \(P_ t\)-free graphs
- On the existence of two non-neighboring subgraphs in a graph
- Dominating sets with small clique covering number
Cited In (3)
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)
