On the public citation graph
The Linear Arboricity of W_5 -minor free graphs
0 signed · 24 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/(sici)1097-0118(199906)31:2<129::aid-jgt5>3.0.co;2-aopenalex-snapshot
On the linear arboricity of planar graphs
inferredcites →https://doi.org/10.1002/jgt.20305openalex-snapshot
The linear arboricity of planar graphs of maximum degree seven is four
inferredcites →https://doi.org/10.1002/jgt.20592openalex-snapshot
A Planar linear arboricity conjecture
inferredcites →https://doi.org/10.1002/jgt.3190080211openalex-snapshot
The linear arboricity of some regular graphs
inferredcites →https://doi.org/10.1002/jgt.3190110203openalex-snapshot
Linear arboricity for graphs with multiple edges
inferredcites →https://doi.org/10.1002/net.3230110108openalex-snapshot
Covering and packing in graphs IV: Linear arboricity
inferredcites →https://doi.org/10.1007/pl00007233openalex-snapshot
Linear Arboricity and Linear k-Arboricity of Regular Graphs
inferredcites →https://doi.org/10.1007/s00373-011-1118-yopenalex-snapshot
The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords
inferredcites →https://doi.org/10.1007/s00493-023-00024-9openalex-snapshot
An Improved Bound for the Linear Arboricity Conjecture
inferredcites →https://doi.org/10.1007/s10114-016-5071-9openalex-snapshot
Linear arboricity of regular digraphs
inferredcites →https://doi.org/10.1007/s10878-013-9680-2openalex-snapshot
Minimum number of disjoint linear forests covering a planar graph
inferredcites →https://doi.org/10.1007/s373-000-8299-9openalex-snapshot
The Linear Arboricity of Series-Parallel Graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)00465-4openalex-snapshot
Probabilistic methods in coloring and decomposition problems
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0095-8956(89)90051-8openalex-snapshot
The regular matroids with no 5-wheel minor
inferredcites →https://doi.org/10.1016/j.dam.2022.08.006openalex-snapshot
The linear arboricity of K5 -minor free graphs
inferredcites →https://doi.org/10.1016/j.ipl.2012.06.007openalex-snapshot
The linear arboricity of planar graphs with maximum degree at least 5
inferredcites →https://doi.org/10.1016/j.jctb.2019.08.009openalex-snapshot
Towards the linear arboricity conjecture
inferredcites →https://doi.org/10.1051/ro/1982160201251openalex-snapshot
Complexité de l'arboricité linéaire d'un graphe
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb56470.xopenalex-snapshot
COVERING AND PACKING IN GRAPHS, I.
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.