Graphs of bounded chordality
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- A survey of -boundedness
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- An algorithm for testing chordality of graphs
- Burling graphs, chromatic number, and orthogonal tree-decompositions
- Coloring and Maximum Weight Independent Set of Rectangles
- Graph minors. II. Algorithmic aspects of tree-width
- Graphs and cubes
- Intersection dimensions of graph classes
- Intersection of chordal graphs and some related partition problems
- On a Coloring Problem.
- On dimensional properties of graphs
- On the chordality of a graph
- Orthogonal tree decompositions of graphs
- Reducibility among combinatorial problems
- Representations of chordal graphs as subtrees of a tree
- Sur le coloriage des graphs
- The Complexity of the Partial Order Dimension Problem
- The chromatic number and other functions of the lexicographic product
- The intersection graphs of subtrees in trees are exactly the chordal graphs
This page was built for publication: Graphs of bounded chordality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901256)
