On the public citation graph
Colouring series-parallel graphs
0 signed · 39 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.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0095-8956(86)90053-5openalex-snapshot
On the chromatic index of multigraphs and a conjecture of Seymour (I)
inferredcites →https://doi.org/10.1016/s0195-6698(81)80033-9openalex-snapshot
Matroids and Multicommodity Flows
inferredcites →https://doi.org/10.1090/psapm/010/0114759openalex-snapshot
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1112/plms/s3-38.3.423openalex-snapshot
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200004)33:4<256::aid-jgt7>3.0.co;2-2openalex-snapshot
The round-up property of the fractional chromatic number for proper circular arc graphs
inferred← citeshttps://doi.org/10.1002/9781118032497.ch6openalex-snapshot
The Conjectures of Hadwiger and Hajós
inferred← citeshttps://doi.org/10.1006/jagm.1996.0008openalex-snapshot
A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_7openalex-snapshot
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_24openalex-snapshot
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_64openalex-snapshot
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/bf02614444openalex-snapshot
Fractional and integral colourings
inferred← citeshttps://doi.org/10.1007/bfb0023853openalex-snapshot
An efficient algorithm for edge-coloring series parallel multigraphs
inferred← citeshttps://doi.org/10.1007/s00373-005-0620-5openalex-snapshot
The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4
inferred← citeshttps://doi.org/10.1007/s00373-018-1986-5openalex-snapshot
Graph Edge Coloring: A Survey
inferred← citeshttps://doi.org/10.1007/s004930100002openalex-snapshot
Optimal Edge-Colourings for a Class of Planar Multigraphs
inferred← citeshttps://doi.org/10.1007/s10255-005-0215-1openalex-snapshot
The Entire Coloring of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/s10878-009-9232-yopenalex-snapshot
Approximating the chromatic index of multigraphs
inferred← citeshttps://doi.org/10.1007/s11425-006-2000-xopenalex-snapshot
Partitioning series-parallel multigraphs into ν*-excluding edge covers
inferred← citeshttps://doi.org/10.1016/j.dam.2018.09.004openalex-snapshot
Homomorphism bounds of signed bipartite K4 -minor-free graphs and edge-colorings of 2k -regular K4 -minor-free multigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.025openalex-snapshot
Max-multiflow/min-multicut for G+H series-parallel
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.04.005openalex-snapshot
On graphs with no induced subdivision of K4
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.01.001openalex-snapshot
Homomorphism bounds and edge-colourings of K4-minor-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.04.002openalex-snapshot
Homomorphisms of partial t-trees and edge-colorings of partial 3-trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00829-0openalex-snapshot
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80043-5openalex-snapshot
Polyhedral Sets and Integer Rounding
inferred← citeshttps://doi.org/10.1109/netcod.2013.6570828openalex-snapshot
Information multicast in (pseudo-)planar networks: Efficient network coding over small finite fields
inferred← citeshttps://doi.org/10.1137/21m1393169openalex-snapshot
The Flow Index of Regular Class I Graphs
inferred← citeshttps://doi.org/10.1137/s0895480101396949openalex-snapshot
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
inferred← citeshttps://doi.org/10.37236/1474openalex-snapshot
List Edge-Colorings of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.4028/www.scientific.net/kem.474-476.2341openalex-snapshot
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
inferred← citeshttps://doi.org/10.70675/4a4a9affz517fz4720z92eaz59ec9f63f9d3openalex-snapshot
Coloring, packing and embedding of graphs
inferred← citeshttps://doi.org/10.70675/72f96944zb711z4ad5z9d5bzaac3410bdf92openalex-snapshot
TDIness and Multicuts
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.