Dominating cliques in \(P_ 5\)-free graphs
From MaRDI portal
Publication:1176051
DOI10.1007/BF02352694zbMath0746.05065OpenAlexW2030973065MaRDI QIDQ1176051
Publication date: 25 June 1992
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02352694
Related Items (72)
Chromatic number of \(P_5\)-free graphs: Reed's conjecture ⋮ Coloring problems on bipartite graphs of small diameter ⋮ On cd-coloring of trees and co-bipartite 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 ⋮ Dominating subgraphs in graphs with some forbidden structures ⋮ Perfect edge domination: hard and solvable cases ⋮ The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time ⋮ Choosability of P 5-Free Graphs ⋮ Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs ⋮ A complexity dichotomy and a new boundary class for the dominating set problem ⋮ Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time ⋮ Characterization of graphs dominated by induced paths ⋮ Hereditarily dominated graphs ⋮ An algorithm to find two distance domination parameters in a graph ⋮ On a conjecture about uniquely colorable perfect graphs ⋮ Minimal asymmetric graphs ⋮ Characterization of \(P_{6}\)-free graphs ⋮ A characterization of line graphs that are squares of graphs ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ Rainbow vertex-connection and forbidden subgraphs ⋮ On indicated coloring of graphs ⋮ Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ On CD-chromatic number and its lower bound in some classes of graphs ⋮ Towards an isomorphism dichotomy for hereditary graph classes ⋮ The complexity of connected dominating sets and total dominating sets with specified induced subgraphs ⋮ Some results on maximum stable sets in certain \(P_{5}\)-free graphs ⋮ On the existence of total dominating subgraphs with a prescribed additive hereditary property ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ Precoloring Extension III: Classes of Perfect Graphs ⋮ 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Independent feedback vertex set for \(P_5\)-free graphs ⋮ Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs ⋮ On the complexity of 4-coloring graphs without long induced paths ⋮ On the chromatic number of \((P_{5},K_{2,t})\)-free graphs ⋮ The price of connectivity for feedback vertex set ⋮ Intersection of longest paths in graph classes ⋮ Domination properties and induced subgraphs ⋮ On-line graph coloring of \({\mathbb{P}_5}\)-free graphs ⋮ On minimally \(b\)-imperfect graphs ⋮ List coloring in the absence of a linear forest ⋮ First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs ⋮ Infinite versus finite graph domination ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ On maximum independent sets in \(P_{5}\)-free graphs ⋮ A Note on k-Colorability of P 5-Free Graphs ⋮ Connected vertex cover for \((sP_1+P_5)\)-free graphs ⋮ On the chromatic number of (P_{5},windmill)-free graphs ⋮ Semicomplete absorbent sets in digraphs ⋮ The price of connectivity for cycle transversals ⋮ Spectral properties of cographs andP5-free graphs ⋮ On indicated coloring of some classes of graphs ⋮ Complete description of forbidden subgraphs in the structural domination problem ⋮ Counting Perfect Matchings and the Switch Chain ⋮ List Coloring in the Absence of a Linear Forest ⋮ Connected greedy coloring of \(H\)-free graphs ⋮ Domination problems on P5-free graphs ⋮ A proof of a conjecture on the connected domination number ⋮ A note on matching-cut in \(P_t\)-free graphs ⋮ Stable sets in certain \(P_6\)-free graphs ⋮ A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree ⋮ Domination, coloring and stability in \(P_5\)-reducible graphs ⋮ On -sparse graphs and other families ⋮ Independent Feedback Vertex Set for P_5-free Graphs ⋮ On \(m\)-centers in \(P_ t\)-free graphs ⋮ On connected dominating sets of restricted diameter
Cites Work
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- On the existence of two non-neighboring subgraphs in a graph
- Star-cutsets and perfect graphs
- On a property of the class of n-colorable graphs
- A characterization of graphs without long induced paths
- The Comparability Graph of a Tree
- Dominating cliques in graphs
This page was built for publication: Dominating cliques in \(P_ 5\)-free graphs
