On the public citation graph
List Edge-Colorings of Series-Parallel Graphs
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1996.0008openalex-snapshot
A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
inferredcites →https://doi.org/10.1006/jctb.1995.1011openalex-snapshot
The List Chromatic Index of a Bipartite Multigraph
inferredcites →https://doi.org/10.1007/bf01204715openalex-snapshot
Colorings and orientations of graphs
inferredcites →https://doi.org/10.1007/bf01261320openalex-snapshot
List edge colourings of some 1-factorable multigraphs
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferredcites →https://doi.org/10.1090/dimacs/049/13openalex-snapshot
New trends in the theory of graph colorings: Choosability and list coloring
inferredcites →https://doi.org/10.7151/dmgt.1049openalex-snapshot
Graph colorings with local constraints -- a survey
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20085openalex-snapshot
NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.21698openalex-snapshot
Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems
inferred← citeshttps://doi.org/10.1002/jgt.21868openalex-snapshot
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21874openalex-snapshot
List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth
inferred← citeshttps://doi.org/10.1002/jgt.22035openalex-snapshot
Hadwiger's Conjecture for ℓ‐Link Graphs
inferred← citeshttps://doi.org/10.1007/11602613_18openalex-snapshot
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_19openalex-snapshot
List Total Colorings of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_11openalex-snapshot
Two Chromatic Conjectures: One for Vertices and One for Edges
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_39openalex-snapshot
On Geometric Structure of Global Roundings for Graphs and Range Spaces
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_12openalex-snapshot
The graph formulation of the union-closed sets conjecture
inferred← citeshttps://doi.org/10.1007/s00373-015-1617-3openalex-snapshot
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
inferred← citeshttps://doi.org/10.1007/s10255-020-0940-5openalex-snapshot
List Edge Coloring of Outer-1-planar Graphs
inferred← citeshttps://doi.org/10.1007/s10255-024-1033-7openalex-snapshot
Conflict-free Incidence Coloring of Outer-1-planar Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.04.015openalex-snapshot
On -acyclic edge colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.030openalex-snapshot
List star edge-coloring of k -degenerate graphs and K4 -minor free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.09.048openalex-snapshot
Structural properties and edge choosability of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.001openalex-snapshot
On equitable and equitable list colorings of series–parallel graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.017openalex-snapshot
Edge covering pseudo-outerplanar graphs with forests
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.009openalex-snapshot
The edge chromatic number of outer-1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.09.002openalex-snapshot
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.08.030openalex-snapshot
The graph formulation of the union-closed sets conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.045openalex-snapshot
Chromatic index, treewidth and maximum degree
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.006openalex-snapshot
List total colorings of series-parallel graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511721328.012openalex-snapshot
List colourings of graphs
inferred← citeshttps://doi.org/10.1137/060667621openalex-snapshot
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
inferred← citeshttps://doi.org/10.1142/s0129054104002285openalex-snapshot
COLORING ALGORITHMS ON SUBCUBIC GRAPHS
inferred← citeshttps://doi.org/10.3390/axioms13060375openalex-snapshot
Edge DP-Coloring in K4-Minor Free Graphs and Planar Graphs
inferred← citeshttps://doi.org/10.37236/1123openalex-snapshot
Total 4-Choosability of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.37236/1124openalex-snapshot
Edge and Total Choosability of Near-Outerplanar Graphs
inferred← citeshttps://doi.org/10.37236/6042openalex-snapshot
Chromatic Index, Treewidth and Maximum Degree
inferred← citeshttps://doi.org/10.47749/t/unicamp.2018.1014643openalex-snapshot
Partition problems in graphs and digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0626openalex-snapshot
A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02122openalex-snapshot
On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7
inferred← citeshttps://doi.org/10.48550/arxiv.1603.05018openalex-snapshot
Chromatic index, treewidth and maximum degree
inferred← citeshttps://doi.org/10.48550/arxiv.1809.02799openalex-snapshot
A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.