Top View
- Forbidden Subgraph Characterizations of Some Classes of Intersection Graphs
- Complexity of Generalized Colourings of Chordal Graphs
- Tree-Decompositions of Small Pathwidthଁ
- Exclusive Graph Searching Vs. Pathwidth Euripides Markou, Nicolas Nisse, Stéphane Pérennes
- CLUSTERING and DOMINATION in PERFECT GRAPHS D.G. CORNEIL Y. PERL in This Paper We Examine the Complexity of Two Important Graph
- Graph Decompositions and Well-Quasi-Ordering
- Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
- Distance Hereditary Graphs Characterizations and Recognition
- Complexity of Generalised Colourings of Chordal Graphs
- A Graph G Is Trivially Perfect If for Each Induced Subgraph H of G, the Number of Maximal Cliques of H Is Equal to the Maximum Size of an Independent Set of H
- Arxiv:1407.1482V8 [Cs.CC] 15 Feb 2016 Solvable; in Contrast, the Problem for General Graphs Is NP-Complete [74]
- Graph Algorithms
- The Chromatic Symmetric Functions of Trivially Perfect Graphs And
- Efficient Algorithms for Graphs with Few P-4'S
- Contributions to Clique-Width of Graphs
- NP-Completeness Results for Some Problems on Subclasses of Bipartite and Chordal Graphs
- Partitioning Perfect Graphs Into Stars René Van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J
- The Clique Operator on Cographs and Serial Graphs