Decomposable and indecomposable critical hypergraphs
From MaRDI portal
Recommendations
- On the number of edges in colour-critical graphs and hypergraphs
- Decomposing hypergraphs into \(k\)-colorable hypergraphs
- Color-critical graphs and hypergraphs with few edges: a survey
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- Coloring hypergraphs of low connectivity
Cited in
(12)- Critical support of an indecomposable graph
- Point partition numbers: decomposable and indecomposable critical graphs
- Critically indecomposable graphs
- Coloring hypergraphs with excluded minors
- Critical hypergraphs and interesting set-pair systems
- Decomposing hypergraphs into \(k\)-colorable hypergraphs
- Connected \(\tau \)-critical hypergraphs of minimal size
- scientific article; zbMATH DE number 4075124 (Why is no real title available?)
- Critical 3-hypergraphs
- Minimal connected \(\tau\)-critical hypergraphs
- Computing and Combinatorics
- On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs
This page was built for publication: Decomposable and indecomposable critical hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286766)