The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Systems of distant representatives (Q1764814) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\) (Q1790473) (← links)
- Hamiltonicity in graphs with few \(P_ 4\)'s (Q1805009) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- Unavoidable doubly connected large graphs (Q1827667) (← links)
- Towards the reconstruction of posets (Q1842096) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← 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)
- Homomorphically full graphs (Q1917297) (← links)
- HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Orthology relations, symbolic ultrametrics, and cographs (Q1937881) (← links)
- Embeddability between right-angled Artin groups.. (Q1945755) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- Limits of structures and the example of tree semi-lattices (Q2012557) (← links)
- On graphs with distance Laplacian spectral radius of multiplicity \(n-3\) (Q2013203) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- Exact values of defective Ramsey numbers in graph classes (Q2067502) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- Exploring symmetries in cographs: obtaining spectra and energies (Q2104933) (← links)
- Generalizing cographs to 2-cographs (Q2111769) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Relationships between algebraic connectivity and vertex connectivity (Q2125891) (← links)
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs (Q2132328) (← links)
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- On the rank of the distance matrix of graphs (Q2161884) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
