List edge coloring of planar graphs without 6-cycles with two chords
Work
Year: 2018
Type: article
Abstract: A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a proper edge-coloring ϕ of G such that ϕ(e) ∈ L(e) for all e ∈ E(G).If G is edge-L-colorable for every... more
Authors Linna Hu, Lei Sun, Jianliang Wu
Institutions Shandong University, Shandong Normal University
Cites: 19
Cited by: 5
Related to: 10
FWCI:
Citation percentile (by year/subfield): 51.27
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond