Optimal edge-colourings for a class of planar multigraphs
From MaRDI portal
Publication:5955208
DOI10.1007/s004930100002zbMath0981.05039OpenAlexW2076369652MaRDI QIDQ5955208
Publication date: 13 February 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930100002
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees ⋮ Graph edge coloring: a survey ⋮ Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
This page was built for publication: Optimal edge-colourings for a class of planar multigraphs