Edge-coloring and f-coloring for various classes of graphs

Xiao Zhou; Takao Nishizeki

doi:10.1007/3-540-58325-4_182

Edge-coloring and f-coloring for various classes of graphs

Xiao Zhou, Takao Nishizeki

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

16 Citations (Scopus)

Abstract

In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ε V at most once. An f-coloring is a generalized coloring in which each color appears at each vertex v ε V at most f(v) times. This paper gives efficient sequential and parallel algorithms which find ordinary edge-colorings and f-colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graphs of fixed arborieity etc.

Original language	English
Title of host publication	Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
Editors	Ding-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
Publisher	Springer Verlag
Pages	199-207
Number of pages	9
ISBN (Print)	9783540583257
DOIs	https://doi.org/10.1007/3-540-58325-4_182
Publication status	Published - 1994
Event	5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China Duration: 1994 Aug 25 → 1994 Aug 27

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	834 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
Country/Territory	China
City	Beijing
Period	94/8/25 → 94/8/27

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-58325-4_182

Cite this

Zhou, X., & Nishizeki, T. (1994). Edge-coloring and f-coloring for various classes of graphs. In D-Z. Du, D-Z. Du, & X-S. Zhang (Eds.), Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings (pp. 199-207). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_182

Edge-coloring and f-coloring for various classes of graphs. / Zhou, Xiao; Nishizeki, Takao.

Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. ed. / Ding-Zhu Du; Ding-Zhu Du; Xiang-Sun Zhang . Springer Verlag, 1994. p. 199-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhou, X & Nishizeki, T 1994, Edge-coloring and f-coloring for various classes of graphs. in D-Z Du, D-Z Du & X-S Zhang (eds), Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 834 LNCS, Springer Verlag, pp. 199-207, 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994, Beijing, China, 94/8/25. https://doi.org/10.1007/3-540-58325-4_182

Zhou X, Nishizeki T. Edge-coloring and f-coloring for various classes of graphs. In Du D-Z, Du D-Z, Zhang X-S, editors, Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Springer Verlag. 1994. p. 199-207. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-58325-4_182

Zhou, Xiao ; Nishizeki, Takao. / Edge-coloring and f-coloring for various classes of graphs. Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. editor / Ding-Zhu Du ; Ding-Zhu Du ; Xiang-Sun Zhang . Springer Verlag, 1994. pp. 199-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4fee1c0972e4411d811f70e449a1db99,

title = "Edge-coloring and f-coloring for various classes of graphs",

abstract = "In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ε V at most once. An f-coloring is a generalized coloring in which each color appears at each vertex v ε V at most f(v) times. This paper gives efficient sequential and parallel algorithms which find ordinary edge-colorings and f-colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graphs of fixed arborieity etc.",

author = "Xiao Zhou and Takao Nishizeki",

note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All rights reserved.; 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 ; Conference date: 25-08-1994 Through 27-08-1994",

year = "1994",

doi = "10.1007/3-540-58325-4_182",

language = "English",

isbn = "9783540583257",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "199--207",

editor = "Ding-Zhu Du and Ding-Zhu Du and {Zhang }, Xiang-Sun",

booktitle = "Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings",

}

TY - GEN

T1 - Edge-coloring and f-coloring for various classes of graphs

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 1994

Y1 - 1994

N2 - In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ε V at most once. An f-coloring is a generalized coloring in which each color appears at each vertex v ε V at most f(v) times. This paper gives efficient sequential and parallel algorithms which find ordinary edge-colorings and f-colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graphs of fixed arborieity etc.

AB - In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ε V at most once. An f-coloring is a generalized coloring in which each color appears at each vertex v ε V at most f(v) times. This paper gives efficient sequential and parallel algorithms which find ordinary edge-colorings and f-colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graphs of fixed arborieity etc.

UR - http://www.scopus.com/inward/record.url?scp=79251487989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79251487989&partnerID=8YFLogxK

U2 - 10.1007/3-540-58325-4_182

DO - 10.1007/3-540-58325-4_182

M3 - Conference contribution

AN - SCOPUS:79251487989

SN - 9783540583257

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 199

EP - 207

BT - Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings

A2 - Du, Ding-Zhu

A2 - Zhang , Xiang-Sun

PB - Springer Verlag

T2 - 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994

Y2 - 25 August 1994 through 27 August 1994

ER -

Edge-coloring and f-coloring for various classes of graphs

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this