Recognizing well covered graphs of families with special P _4-components

DOI10.1007/S00373-011-1123-1zbMATH Open1267.05207OpenAlexW2029869761MaRDI QIDQ2376085FDOQ2376085

Authors: Sulamita Klein, Célia P. de Mello, Aurora Morgana 

Publication date: 26 June 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1123-1

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

zbMATH Keywords

modular decompositionprimeval decompositionwell covered graphsgraphs with few \(P _{4}\)'s

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A characterization of well covered graphs of girth 5 or greater
• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs
• Complement reducible graphs
• Modular decomposition and transitive orientation
• Title not available (Why is that?)
• On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
• The splittance of a graph
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• Title not available (Why is that?)
• A New Class of Brittle Graphs
• Title not available (Why is that?)
• Recognizing Greedy Structures
• The structure of well-covered graphs and the complexity of their recognition problems
• Complexity results for well‐covered graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• Well covered simplicial, chordal, and circular arc graphs
• Well-covered graphs and extendability
• P-Components and the Homogeneous Decomposition of Graphs
• On the well-coveredness of Cartesian products of graphs
• Well-covered graphs and factors
• Subdivisions, parity and well-covered graphs

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)