P-Components and the Homogeneous Decomposition of Graphs

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (36)

A fast parallel algorithm to recognize P4-sparse graphs
Operator Decomposition of Graphs and the Reconstruction Conjecture
A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs
Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
Recognizing well covered graphs of families with special \(P _{4}\)-components
Maximization coloring problems on graphs with few \(P_4\)
Distinct edge geodetic decomposition in graphs
Title not available (Why is that?)
SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s
Recognizing the \(P_4\)-structure of bipartite graphs
Minimal separators in extended \(P_4\)-laden graphs
Title not available (Why is that?)
Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
Partitioning \(P_4\)-tidy graphs into a stable set and a forest
Title not available (Why is that?)
\(2K_2\)-partition of some classes of graphs
A survey of the algorithmic aspects of modular decomposition
Hardness and efficiency on minimizing maximum distances in spanning trees
On the \(b\)-coloring of \(P_{4}\)-tidy graphs
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Edge tree spanners
Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs
Bipartite-perfect graphs
Restricted coloring problems on graphs with few \(P_4\)'s
On the structure of graphs with few \(P_4\)s
Graphs with few \(P_4\)'s under the convexity of paths of order three
Locally identifying coloring of graphs with few P4s
Tree-like \(P_4\)-connected graphs
The \(A_4\)-structure of a graph
Path-Bicolorable Graphs
Recognition and isomorphism of tree-like \(P_4\)-connected graphs
Path-bicolorable graphs
On the \(P_4\)-components of graphs
Triangulating graphs with few \(P_4\)'s
A new characterization of \(P_4\)-connected graphs
Peakless functions on graphs

This page was built for publication: P-Components and the Homogeneous Decomposition of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847366)