Infinite triangulated graphs
From MaRDI portal
Cites work
- Embedding Trees in the Rationals
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 941487 (Why is no real title available?)
- Infinite graphs—A survey
- Normal hypergraphs and the perfect graph conjecture
- On Dilworth's theorem in the infinite case
- Souslin's Conjecture
- Trees
Cited in
(5)- Simplicial decompositions of graphs: A survey of applications
- A bound on the chromatic number of graphs without certain induced subgraphs
- A note on infinite triangulated graphs
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
- A note on uncountable chordal graphs
This page was built for publication: Infinite triangulated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247986)