A Vizing-type theorem for matching forests

DOI10.1016/S0012-365X(02)00671-4zbMath1008.05062OpenAlexW2086703449MaRDI QIDQ1861260

Judith Keijsper

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00671-4

zbMATH Keywords

matchingbranchingedge colouringmixed 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 (3)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Equitable partitions into matchings and coverings in mixed graphs ⋮ Optimal Matching Forests and Valuated Delta-Matroids

This page was built for publication: A Vizing-type theorem for matching forests