On upper bounds for the independent transversal domination number
From MaRDI portal
Publication:1693131
DOI10.1016/j.dam.2017.09.011zbMath1377.05138OpenAlexW2774920496MaRDI QIDQ1693131
Christoph Brause, Ingo Schiermeyer, Elkin Vumar, Kenta Ozeki, Michael A. Henning
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.09.011
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering the cliques of a graph with vertices
- Combinatorial properties of the family of maximum stable sets of a graph
- Independent domination in graphs: A survey and recent results
- Crown structures for vertex cover kernelization
- Independent transversal domination in graphs
- Domination-balanced graphs
- Vertex packings: Structural properties and algorithms
- Transversals of Vertex Partitions in Graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Independent transversal dominating sets in graphs: Complexity and structural properties