Edge-Coloring and f-Coloring for Various Classes of Graphs

DOI10.7155/jgaa.00012zbMath0918.05054OpenAlexW2152316777MaRDI QIDQ4243441

Xiao Zhou, Takao Nishizeki

Publication date: 18 May 1999

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/230347

zbMATH Keywords

edge-coloringsequential and parallel algorithms\(f\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

NP‐completeness of list coloring and precoloring extension on the edges of planar graphs ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ Finding small complete subgraphs efficiently ⋮ On defected colourings of graphs

This page was built for publication: Edge-Coloring and f-Coloring for Various Classes of Graphs