scientific article; zbMATH DE number 3322854
From MaRDI portal
Publication:5603088
Cited in
(20)- Intersection graphs of paths in a tree
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Optimal assignment of broadcasting frequencies
- Coloring graphs with stable cutsets
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Motivations and history of some of my conjectures
- Vertex deletion problems on chordal graphs
- Exploiting sparsity for the min \(k\)-partition problem
- Special simplices and Gorenstein toric rings.
- Triangulated graphs and the elimination process
- Anti-blocking polyhedra
- Chordal editing is fixed-parameter tractable
- Line perfect graphs
- Blocking and anti-blocking pairs of polyhedra
- Supersolvable saturated matroids and chordal graphs
- Chordal matroids arising from generalized parallel connections
- On groups with chordal power graph, including a classification in the case of finite simple groups
- Generating subgraphs in chordal graphs
- Succinct data structures for chordal graph with bounded leafage or vertex leafage
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603088)
