Minimal connected -critical hypergraphs

DOI10.1007/S00373-006-0656-1MaRDI QIDQ855295zbMATH OpenOpenAlexFDO

Authors Matěj Stehlík

Publication date 5 January 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-006-0656-1

zbMATH Keywords

Colour-critical graphs

Mathematics Subject Classification ID

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

Recommendations

• Connected \(\tau \)-critical hypergraphs of minimal size
• scientific article; zbMATH DE number 3933117
• Maximal \(\tau\)-critical linear hypergraphs
• Decomposable and indecomposable critical hypergraphs
• t-expansive and t-wise intersecting hypergraphs

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• scientific article; zbMATH DE number 3211575 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• Chromatic neighborhood sets
• Connected \(\tau \)-critical hypergraphs of minimal size
• Critical graphs with connected complements
• Matchings and covers in hypergraphs
• t-expansive and t-wise intersecting hypergraphs

Cited in

(6)

• Connected \(\tau \)-critical hypergraphs of minimal size
• Order plus size of τ‐critical graphs
• scientific article; zbMATH DE number 3933117 (Why is no real title available?)
• Spectral strengthening of a theorem on transversal critical graphs
• Maximal \(\tau\)-critical linear hypergraphs
• t-expansive and t-wise intersecting hypergraphs

This page was built for publication: Minimal connected \(\tau\)-critical hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855295)