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

DOI10.7155/JGAA.00012MaRDI QIDQ4243441zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(12)

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

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)