On the public citation graph
Edge and Total Choosability of Near-Outerplanar Graphs
0 signed · 23 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.1002/jgt.3190160109openalex-snapshot
A short proof of a theorem of dirac's about hadwiger's conjecture
inferredcites →https://doi.org/10.1006/eujc.2000.0430openalex-snapshot
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs
inferredcites →https://doi.org/10.1006/jctb.1997.1780openalex-snapshot
List Edge and List Total Colourings of Multigraphs
inferredcites →https://doi.org/10.1007/3-540-45071-8_19openalex-snapshot
List Total Colorings of Series-Parallel Graphs
inferredcites →https://doi.org/10.1007/bf01261320openalex-snapshot
List edge colourings of some 1-factorable multigraphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00371-xopenalex-snapshot
Choosability conjectures and multicircuits
inferredcites →https://doi.org/10.1016/s0166-218x(99)00023-2openalex-snapshot
The Hall number, the Hall index, and the total Hall number of a graph
inferredcites →https://doi.org/10.1017/cbo9780511721328.012openalex-snapshot
List colourings of graphs
inferredcites →https://doi.org/10.1017/s0963548397003210openalex-snapshot
List Total Colourings of Graphs
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.37236/1123openalex-snapshot
Total 4-Choosability of Series-Parallel Graphs
inferredcites →https://doi.org/10.37236/1474openalex-snapshot
List Edge-Colorings of Series-Parallel Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20424openalex-snapshot
A decomposition for total‐coloring partial‐grids and list‐total‐coloring outerplanar 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/s00373-011-1114-2openalex-snapshot
On Group Choosability of Total Graphs
inferred← citeshttps://doi.org/10.1007/s10255-020-0940-5openalex-snapshot
List Edge Coloring of Outer-1-planar Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.024openalex-snapshot
Total chromatic number of unichord-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.043openalex-snapshot
Entire choosability of near-outerplane 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.2013.03.020openalex-snapshot
Edge-colouring and total-colouring chordless graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.085openalex-snapshot
Total chromatic number of {square,unichord}-free graphs
inferred← citeshttps://doi.org/10.37236/1123openalex-snapshot
Total 4-Choosability of Series-Parallel Graphs
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.