Uniquely restricted matchings and edge colorings

DOI10.1007/978-3-319-68705-6_8zbMath1483.05171arXiv1611.06815OpenAlexW2550363546MaRDI QIDQ1687907

Dieter Rautenbach, Julien Baste, Ignasi Sau

Publication date: 4 January 2018

Full work available at URL: https://arxiv.org/abs/1611.06815

zbMATH Keywords

bipartite graphapproximation algorithmedge coloringuniquely restricted matchingsubcubic graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Degenerate matchings and edge colorings ⋮ Lower bounds on the uniquely restricted matching number ⋮ On the complexity of minimum maximal uniquely restricted matching

This page was built for publication: Uniquely restricted matchings and edge colorings