Graphs with at most two moplexes
From MaRDI portal
Publication:6595515
Recommendations
Cites work
- scientific article; zbMATH DE number 176590 (Why is no real title available?)
- scientific article; zbMATH DE number 1107735 (Why is no real title available?)
- scientific article; zbMATH DE number 2044943 (Why is no real title available?)
- scientific article; zbMATH DE number 1496855 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A Unified View of Graph Searching
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
- A short proof that `proper = unit'
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Algorithms for graphs with small octopus
- Asteroidal Triple-Free Graphs
- Asteroidal triples of moplexes
- Avoidable paths in graphs
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Characterizations and algorithmic applications of chordal graph embeddings
- Colouring AT-free graphs
- Domination on Cocomparability Graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Extremities and orderings defined by generalized graph search algorithms
- Feedback vertex set on AT-free graphs
- Finding Hamiltonian circuits in proper interval graphs
- Geometric algorithms and combinatorial optimization
- Graph Classes: A Survey
- Graph extremities defined by search algorithms
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Graph-Theoretic Concepts in Computer Science
- Independent Sets in Asteroidal Triple-Free Graphs
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Linear recognition of almost interval graphs
- Linear time LexDFS on cocomparability graphs
- Maximum cardinality search for computing minimal triangulations of graphs
- Maximum cut on interval graphs of interval count four is NP-complete
- Minimal proper interval completions
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Minimal triangulations of graphs: a survey
- Minimal vertex separators of chordal graphs
- Moplex elimination orderings
- Moplex orderings generated by the LexDFs algorithm
- Normal hypergraphs and the perfect graph conjecture
- On asteroidal sets in chordal graphs
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On rigid circuit graphs
- On the structure of graphs with bounded asteroidal number
- On the tree representation of chordal graphs
- On treewidth approximations
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- Separability generalizes Dirac's theorem
- The Roberts characterization of proper and unit interval graphs
- The leafage of a chordal graph
- Treewidth for graphs with small chordality
- Triangulation and clique separator decomposition of claw-free graphs
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
This page was built for publication: Graphs with at most two moplexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595515)
