Dominating cliques in P_ 5-free graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of graphs without long induced paths
- Dominating cliques in graphs
- On a property of the class of n-colorable graphs
- On the existence of two non-neighboring subgraphs in a graph
- Star-cutsets and perfect graphs
- The Comparability Graph of a Tree
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
Cited in
(79)- Domination problems on \(P_{5}\)-free graphs
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- A characterization of line graphs that are squares of graphs
- On -sparse graphs and other families
- Domination properties and induced subgraphs
- A note on efficient domination in a superclass of \(P_5\)-free graphs
- On the chromatic number of some \(P_5\)-free graphs
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Coloring problems on bipartite graphs of small diameter
- On cd-coloring of trees and co-bipartite graphs
- Semicomplete absorbent sets in digraphs
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
- Choosability of P 5-Free Graphs
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- Infinite versus finite graph domination
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- On the complexity of 4-coloring graphs without long induced paths
- Minimal asymmetric graphs
- Independent feedback vertex set for \(P_5\)-free graphs
- Counting perfect matchings and the switch chain
- On maximum independent sets in \(P_{5}\)-free graphs
- Domination, coloring and stability in \(P_5\)-reducible graphs
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- scientific article; zbMATH DE number 2114467 (Why is no real title available?)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- A new characterization of P_k-free graphs
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Perfect edge domination: hard and solvable cases
- On minimally \(b\)-imperfect graphs
- A Note on k-Colorability of P 5-Free Graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Characterization of graphs dominated by induced paths
- On \(r\)-hued colorings of graphs without short induced paths
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- List coloring in the absence of a linear forest
- Independent Feedback Vertex Set for P_5-free Graphs
- List coloring in the absence of a linear forest
- A proof of a conjecture on the connected domination number
- Characterization of \(P_{6}\)-free graphs
- On the existence of total dominating subgraphs with a prescribed additive hereditary property
- A new characterization of \(P_{6}\)-free graphs
- An algorithm to find two distance domination parameters in a graph
- On connected dominating sets of restricted diameter
- A complexity dichotomy and a new boundary class for the dominating set problem
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Spectral properties of cographs and \(P_5\)-free graphs
- Stable sets in certain \(P_6\)-free graphs
- Dominating subgraphs in graphs with some forbidden structures
- Finding dominating induced matchings in P₉-free graphs in polynomial time
- On indicated coloring of graphs
- Dominating cycles and forbidden pairs containing \(P_5\)
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
- Connected greedy coloring of H-free graphs
- On a conjecture about uniquely colorable perfect graphs
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
- On \(m\)-centers in \(P_ t\)-free graphs
- Rainbow vertex-connection and forbidden subgraphs
- Exact and parameterized algorithms for the independent cutset problem
- Graphs without induced P5and C5
- Intersection of longest paths in graph classes
- Towards an isomorphism dichotomy for hereditary graph classes
- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
- The complexity of the perfect matching-cut problem
- A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
- A note on matching-cut in \(P_t\)-free graphs
- The price of connectivity for feedback vertex set
- Precoloring Extension III: Classes of Perfect Graphs
- scientific article; zbMATH DE number 5670545 (Why is no real title available?)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- On the chromatic number of (P_{5},windmill)-free graphs
- Hereditarily dominated graphs
- On CD-chromatic number and its lower bound in some classes of graphs
- The price of connectivity for cycle transversals
This page was built for publication: Dominating cliques in \(P_ 5\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176051)
