Minimal connected -critical hypergraphs

DOI10.1007/S00373-006-0656-1zbMATH Open1107.05067OpenAlexW1985493393MaRDI QIDQ855295FDOQ855295

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

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

zbMATH Keywords

Colour-critical graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Matchings and covers in hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Critical graphs with connected complements
• t-expansive and t-wise intersecting hypergraphs
• Connected \(\tau \)-critical hypergraphs of minimal size
• Chromatic neighborhood sets

Cited In (6)

• Connected \(\tau \)-critical hypergraphs of minimal size
• Order plus size of τ‐critical graphs
• Title not available (Why is that?)
• Maximal \(\tau\)-critical linear hypergraphs
• Spectral strengthening of a theorem on transversal critical graphs
• 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)