Common domination perfect graphs
From MaRDI portal
Publication:6184333
DOI10.1016/j.dam.2023.09.028arXiv2208.07092OpenAlexW4387425565MaRDI QIDQ6184333
Magda Dettlaff, Jerzy Topp, Michael A. Henning
Publication date: 24 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.07092
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on an induced subgraph characterization of domination perfect graphs
- On domination and independent domination numbers of a graph
- On graphs with equal domination and independent domination numbers
- Perfect graphs of strong domination and independent strong domination
- Independent domination in graphs: A survey and recent results
- Critical concepts in domination
- Construction of trees and graphs with equal domination parameters
- Unique irredundance, domination and independent domination in graphs
- A characterization of domination perfect graphs
- A note on the characterization of domination perfect graphs
- An induced subgraph characterization of domination perfect graphs
- Graphs with equal domination and independent domination numbers
- Domination in Graphs: Core Concepts
- Structures of Domination in Graphs
- Topics in Domination in Graphs
This page was built for publication: Common domination perfect graphs
