Maximal edge colorings of graphs

DOI10.1016/j.ejc.2023.103824arXiv1912.09538OpenAlexW2996182638MaRDI QIDQ6181990

Andrzej Grzesik, Sebastian Babiński

Publication date: 23 January 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• The spectrum of maximal sets of one-factors
• Maximal sets of 2-factors and Hamiltonian cycles
• The greedy algorithm is optimal for on-line edge coloring
• On-line edge-coloring with a fixed number of colors
• Maximal edge-colorings of graphs
• Maximal partial Latin cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal edge colorings of graphs