Upper bounds on the uniquely restricted chromatic index

DOI10.1002/JGT.22429zbMATH Open1417.05058OpenAlexW2900773225MaRDI QIDQ5229533FDOQ5229533

Dieter Rautenbach, Ignasi Sau, Julien Baste

Publication date: 15 August 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02412578/file/Upper.pdf

Recommendations

• Uniquely restricted matchings and edge colorings
• Lower bounds on the uniquely restricted matching number
• Graphs in which some and every maximum matching is uniquely restricted
• Approximating maximum uniquely restricted matchings in bipartite graphs
• Uniquely restricted matchings

zbMATH Keywords

edge-coloringstrong chromatic indexchromatic indexacyclic chromatic indexuniquely restricted matching

Mathematics Subject Classification ID

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

Cited In (1)

• Parameterized results on acyclic matchings with implications for related problems

This page was built for publication: Upper bounds on the uniquely restricted chromatic index

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