Results 1 to 10 of about 978,459 (257)
The strong edge-coloring for graphs with small edge weight
Discrete Mathematics, 2020 A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. The edge weight of a graph G is defined to be max{dG(u)+dG(v)|e=uv∈E(G)}. We study graphs with edge weight at most 7. We show that 1) every graph with edge
Gexin Yu, Xiangqian Zhou, Lily Chen
exaly +2 more sources
Acyclic Edge-Coloring of Planar Graphs
SIAM Journal on Discrete Mathematics, 2011 A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted.
Frédéric Havet +2 more
exaly +1 more source
Some of the next articles are maybe not open access.
Acyclic edge coloring of graphs with maximum degree 4
Journal of Graph Theory, 2009Manu Basavaraju
exaly
Normal 6-edge-colorings of some bridgeless cubic graphs
Discrete Applied Mathematics, 2020Giuseppe Mazzuoccolo, Vahan Mkrtchyan
exaly
Star Edge Coloring of Some Classes of Graphs
Journal of Graph Theory, 2016Riste Škrekovski +2 more
exaly
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
SIAM Journal on Computing, 1982Harold N. Gabow
exaly
Strong edge-coloring of graphs with maximum degree 4 using 22 colors
Discrete Mathematics, 2006Daniel Wesley Cranston
exaly