A new characterization of P₆-free graphs
From MaRDI portal
Publication:972332
Recommendations
- A New Characterization of P 6-Free Graphs
- Characterization of \(P_{6}\)-free graphs
- A new characterization of P_k-free graphs
- A New Characterization of P_k-free Graphs
- Total dominations in P₆-free graphs
- Critical \((P_6, \mathrm{banner})\)-free graphs
- Irredundance perfect andP6-free graphs
- scientific article; zbMATH DE number 5279372
- 4-colorability of P₆-free graphs
- Four-coloring \(P_6\)-free graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1247724 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 5279372 (Why is no real title available?)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- A Linear Recognition Algorithm for Cographs
- A Note on "The Comparability Graph of a Tree"
- A simple linear time algorithm for cograph recognition
- Characterization of \(P_{6}\)-free graphs
- Clique-width for 4-vertex forbidden subgraphs
- Dominating Bipartite Subgraphs in Graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Dominating cliques in graphs
- Dominating subgraphs in graphs with some forbidden structures
- Graph Classes: A Survey
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
- The Comparability Graph of a Tree
- The complexity of coloring graphs without long induced paths
Cited in
(31)- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
- Finding matching cuts in \(H\)-free graphs
- A New Characterization of P 6-Free Graphs
- Total domination and open packing in two subclasses of triangle-free graphs
- Structural domination and coloring of some ( P₇ , C₇)-free graphs
- Graph grabbing game on graphs with forbidden subgraphs
- Finding \(d\)-cuts in graphs of bounded diameter, graphs of bounded radius and \(H\)-free graphs
- Irredundance perfect andP6-free graphs
- 4-coloring \((P_6, \text{bull})\)-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- A new characterization of P_k-free graphs
- scientific article; zbMATH DE number 5279372 (Why is no real title available?)
- The price of connectivity for dominating set: upper bounds and complexity
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
- -boundedness and related problems on graphs without long induced paths: a survey
- The signature of chordal graphs and cographs
- Characterization of \(P_{6}\)-free graphs
- Partitioning graphs into connected parts
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Partitioning Graphs into Connected Parts
- New Polynomial Case for Efficient Domination in P 6-free Graphs
- On partitioning a graph into two connected subgraphs
- Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs
- Induced disjoint paths and connected subgraphs for H-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
- Laplacian integral graphs with a given degree sequence constraint
- A New Characterization of P_k-free Graphs
- Prime graphs, matchings and the Castelnuovo-Mumford regularity
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
- The niche graphs of multipartite tournaments
This page was built for publication: A new characterization of \(P_{6}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972332)
