Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
From MaRDI portal
Publication:3000517
DOI10.1007/978-3-642-19222-7_30zbMath1326.05127OpenAlexW2168666129MaRDI QIDQ3000517
Ferdinando Cicalese, Martin Milanič
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_30
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structure of bull-free graphs II and III -- a summary
- On rigid circuit graphs
- The strong perfect graph theorem
- Claw-free graphs. IV: Decomposition theorem
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Decomposition by clique separators
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Universally signable graphs
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- A theorem of Truemper
- Edge dominating set and colorings on graphs with fixed clique-width
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Linear time solvable optimization problems on graphs of bounded clique-width
- Even-hole-free graphs part I: Decomposition theorem
- Isomorphism of graphs which are pairwise k-separable
- On graphs with polynomially solvable maximum-weight clique problem
- A New Algorithm for Generating All the Maximal Independent Sets
- Even and odd holes in cap-free graphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- On the Relationship Between Clique-Width and Treewidth
This page was built for publication: Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
