Recognizing well covered graphs of families with special P _4-components
From MaRDI portal
Publication:2376085
Recommendations
- On the \(P_4\)-components of graphs
- On the recognition of \(P_4\)-indifferent graphs
- On the structure of 4-regular planar well-covered graphs
- Recognizing the \(P_4\)-structure of bipartite graphs
- scientific article; zbMATH DE number 1953107
- scientific article; zbMATH DE number 398945
- scientific article; zbMATH DE number 1409193
- The structure of well-covered graphs and the complexity of their recognition problems
- The structure of well-covered graphs with no cycles of length 4
- Recognizing the \(P_4\)-structure of block graphs
Cites work
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A New Class of Brittle Graphs
- A characterization of well covered graphs of girth 5 or greater
- A tree representation for \(P_ 4\)-sparse graphs
- Complement reducible graphs
- Complexity results for well‐covered graphs
- Modular decomposition and transitive orientation
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On extended P₄-reducible and extended P₄-sparse graphs
- On the well-coveredness of Cartesian products of graphs
- P-Components and the Homogeneous Decomposition of Graphs
- Recognizing Greedy Structures
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Some covering concepts in graphs
- Subdivisions, parity and well-covered graphs
- The splittance of a graph
- The structure of well-covered graphs and the complexity of their recognition problems
- WELL-COVERED GRAPHS: A SURVEY
- Well covered simplicial, chordal, and circular arc graphs
- Well-covered graphs and extendability
- Well-covered graphs and factors
Cited in
(6)- FPT algorithms to recognize well covered graphs
- On the probe problem for \((r,\ell )\)-well-coveredness
- Computing well-covered vector spaces of graphs using modular decomposition
- Recognizing well-dominated graphs is coNP-complete
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
This page was built for publication: Recognizing well covered graphs of families with special \(P _{4}\)-components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376085)
