A generalisation of matching and colouring

DOI10.1016/j.disc.2004.04.006zbMath1044.05059OpenAlexW2050602516MaRDI QIDQ1877669

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

MatchingColouringCritical graph

Mathematics Subject Classification ID

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

Related Items (1)

A hypergraph version of the Gallai-Edmonds Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Critical graphs with connected complements
• An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

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