Pages that link to "Item:Q4847366"

The following pages link to P-Components and the Homogeneous Decomposition of Graphs (Q4847366):

Displaying 36 items.

• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
• Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
• On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
• Path-bicolorable graphs (Q659746) (← links)
• Peakless functions on graphs (Q678883) (← links)
• Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
• Recognizing the \(P_4\)-structure of bipartite graphs (Q1296570) (← links)
• A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
• On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
• Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
• Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
• \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
• Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
• Bipartite-perfect graphs (Q1811078) (← links)
• Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
• On the \(P_4\)-components of graphs (Q1971221) (← links)
• Edge tree spanners (Q2056906) (← links)
• Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367) (← links)
• A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs (Q2181233) (← links)
• Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
• Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
• Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
• SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
• The \(A_4\)-structure of a graph (Q2911060) (← links)
• Operator Decomposition of Graphs and the Reconstruction Conjecture (Q3439559) (← links)
• Path-Bicolorable Graphs (Q3655151) (← links)
• (Q4007184) (← links)
• (Q4254865) (← links)
• (Q4691781) (← links)
• Distinct edge geodetic decomposition in graphs (Q4957555) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
• Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
• Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
• A new characterization of \(P_4\)-connected graphs (Q6550529) (← links)