On the chordality of a graph
From MaRDI portal
Recommendations
Cites work
Cited in
(24)- Boxicity of graphs with bounded degree
- Structural conditions for cycle completable graphs
- The square of a chordal graph
- Necessary edges in k-chordalisations of graphs
- Chordally signed graphs
- Chordal graphs and the characteristic polynomial
- Non-inclusion and other subclasses of chordal graphs
- Lower bounds for boxicity
- Rank inequalities for chordal graphs
- scientific article; zbMATH DE number 4132197 (Why is no real title available?)
- Chord theorems on graphs
- On the interval number of a chordal graph
- scientific article; zbMATH DE number 4077265 (Why is no real title available?)
- scientific article; zbMATH DE number 2042724 (Why is no real title available?)
- scientific article; zbMATH DE number 1533810 (Why is no real title available?)
- Orthogonal tree decompositions of graphs
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Strong Chordality of Graphs with Possible Loops
- The Neighborhood Polynomial of Chordal Graphs
- Intersection of chordal graphs and some related partition problems
- Graphs of bounded chordality
- How is a chordal graph like a supersolvable binary matroid?
- Polarity of chordal graphs
- Boxicity and cubicity of asteroidal triple free graphs
This page was built for publication: On the chordality of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4693359)
