Pages that link to "Item:Q1183332"
From MaRDI portal
The following pages link to A tree representation for \(P_ 4\)-sparse graphs (Q1183332):
Displaying 50 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- On prime inductive classes of graphs (Q648987) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452) (← links)
- Matroids arisen from matrogenic graphs (Q1356745) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
- \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Hamiltonicity in graphs with few \(P_ 4\)'s (Q1805009) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
- Faster algorithms for cograph edge modification problems (Q2308466) (← links)
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs (Q2323491) (← links)
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- On some domination colorings of graphs (Q2399288) (← links)