Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
From MaRDI portal
Publication:2222949
DOI10.1016/j.disc.2020.112244zbMath1456.05123arXiv1907.05018OpenAlexW3111819793MaRDI QIDQ2222949
Manoj M. Belavadi, T. Karthick, Sheshayya A. Choudum
Publication date: 27 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.05018
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
- Domination properties and induced subgraphs
- Dominating sets for split and bipartite graphs
- Characterization of graphs dominated by induced paths
- A new characterization of \(P_{6}\)-free graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Clustering and domination in perfect graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Perfect coloring and linearly χ-boundP6-free graphs
- The Comparability Graph of a Tree
- The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
- Square-Free Graphs with No Six-Vertex Induced Path
- Dominating Bipartite Subgraphs in Graphs
- Perfect divisibility and 2‐divisibility
- Dominating cliques in graphs
This page was built for publication: Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
