A generalisation of matching and colouring

DOI10.1016/J.DISC.2004.04.006MaRDI QIDQ1877669zbMATH OpenOpenAlexFDO

Authors Matěj Stehlík

Publication date 19 August 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.04.006

zbMATH Keywords

ColouringCritical graphMatching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Extensions of Gallai's graph covering theorems for uniform hypergraphs
• scientific article; zbMATH DE number 975376
• Fractional v. integral covers in hypergraphs of bounded edge size
• Covering graphs with matchings of fixed size
• On matching cover of graphs

Cites work

• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
• Critical graphs with connected complements
• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 3211575 (Why is no real title available?)
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• Matching theory
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs

Cited in

(4)

• Perfect matchings in shadow colorings
• A hypergraph version of the Gallai-Edmonds Theorem
• On matching cover of graphs
• An upper bound for the excessive index of an r-graph

This page was built for publication: A generalisation of matching and colouring

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