Every graph with maximum degree at most four is (1¹,2¹⁹)-packing edge-colorable and (1²,2¹⁷)-packing edge-colorable

DOI10.2140/INVOLVE.2025.18.261MaRDI QIDQ7008161zbMATH OpenFDO

Authors Cicely Henderson, Camille Kennedy, Michael Santana

Publication date 24 March 2025

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/INVOLVE.2025.18.261

zbMATH Keywords

edge-coloringmaximum degree

Mathematics Subject Classification ID

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

Cites work

• Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• Maximum matchings in regular graphs
• On S-packing edge-colorings of cubic graphs
• On an estimate of the chromatic class of a \(p\)-graph
• On Representatives of Subsets
• Strong chromatic index of graphs with maximum degree four
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs

This page was built for publication: Every graph with maximum degree at most four is \((1^1,2^{19})\)-packing edge-colorable and \((1^2,2^{17})\)-packing edge-colorable

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