Edge-Coloring Problems for Graphs.

DOI10.4036/IIS.1994.19MaRDI QIDQ4241100zbMATH OpenOpenAlexFDO

Authors Shin-Ichi Nakano, Takao Nishizeki

Publication date 29 April 1999

Published in Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4036/iis.1994.19

zbMATH Keywords

algorithmsedge-coloringupper bounds

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1998816
• Edge-Coloring and f-Coloring for Various Classes of Graphs
• scientific article; zbMATH DE number 1555935

Cited in

(18)

• On resolving edge colorings in graphs
• On edge orienting methods for graph coloring
• The method of coloring in graphs and its application
• Colored problems in graphs
• Reachability problems in edge-colored digraphs
• Optimal edge-coloring with edge rate constraints
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• Edge-colouring and total-colouring chordless graphs
• scientific article; zbMATH DE number 68344 (Why is no real title available?)
• Edge-Coloring and f-Coloring for Various Classes of Graphs
• scientific article; zbMATH DE number 1998816 (Why is no real title available?)
• scientific article; zbMATH DE number 913024 (Why is no real title available?)
• Graph endpoint coloring and distributed processing
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
• Some sufficient conditions for a graph to be of \(C_f\) 1
• A special \(f\)-edge cover-coloring of multigraphs
• A note on the \((g, f)\)-coloring

This page was built for publication: Edge-Coloring Problems for Graphs.

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