Decomposable and indecomposable critical hypergraphs

DOI10.4310/JOC.2016.V7.N2.A11zbMATH Open1336.05096OpenAlexW2285106558MaRDI QIDQ286766FDOQ286766

Authors: Michael Stiebitz, Patrick Storch, Bjarne Toft 

Publication date: 25 May 2016

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2016.v7.n2.a11

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

zbMATH Keywords

chromatic number\(k\)-critical hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cited In (12)

• Critical hypergraphs and interesting set-pair systems
• Computing and Combinatorics
• Coloring hypergraphs with excluded minors
• Critical 3-hypergraphs
• Title not available (Why is that?)
• Minimal connected \(\tau\)-critical hypergraphs
• Decomposing hypergraphs into \(k\)-colorable hypergraphs
• Critical support of an indecomposable graph
• Critically indecomposable graphs
• Point partition numbers: decomposable and indecomposable critical graphs
• Connected \(\tau \)-critical hypergraphs of minimal size
• 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)