Maximal edge-colorings of graphs

MaRDI QIDQ6621153FDOQ6621153

A. Grzesik, Sebastian Babiński

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• The greedy algorithm is optimal for on-line edge coloring
• Maximal designs and configurations -- a survey
• Title not available (Why is that?)
• Maximal partial Latin cubes
• Maximal sets of 2-factors and Hamiltonian cycles
• Title not available (Why is that?)
• On-line edge-coloring with a fixed number of colors
• Title not available (Why is that?)
• Maximal edge-colorings of graphs
• Title not available (Why is that?)

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

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