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

DOI10.7155/JGAA.00012zbMATH Open0918.05054OpenAlexW2152316777MaRDI QIDQ4243441FDOQ4243441

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1555935
• Some results on edge-colourings of graphs
• On \(\mathrm{M}_f\)-edge colorings of graphs
• scientific article; zbMATH DE number 68344
• A generalization of edge-coloring in graphs
• The classification of graphs on edge covering coloring
• Edge-Coloring Problems for Graphs.
• On edge covering colorings of graphs
• scientific article; zbMATH DE number 3885932
• Edge-coloring of multigraphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (12)

• A classification of edge-colored graphs based on properly colored walks
• On defected colourings of graphs
• Algorithms for finding f-colorings of partial k-trees
• Title not available (Why is that?)
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Finding small complete subgraphs efficiently
• NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
• The edge-labeling and vertex-colors of \(K_n\)
• Some results on an edge coloring problem of Folkman and Fulkerson
• Optimal online edge coloring of planar graphs with advice
• A note on the \((g, f)\)-coloring
• Simple reduction of f-colorings to edge-colorings

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

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