On the public citation graph
Linear Arboricity and Linear k-Arboricity of Regular Graphs
0 signed · 45 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/jctb.1998.1868openalex-snapshot
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45132.xopenalex-snapshot
COVERING AND PACKING IN GRAPHS, I.
inferredcites →https://doi.org/10.1112/jlms/s2-37.121.14openalex-snapshot
Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs
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.20592openalex-snapshot
A Planar linear arboricity conjecture
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_23openalex-snapshot
Short Tours through Large Linear Forests
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_40openalex-snapshot
Trees, Paths, Stars, Caterpillars and Spiders
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_22openalex-snapshot
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_19openalex-snapshot
A Planar Linear Arboricity Conjecture
inferred← citeshttps://doi.org/10.1007/s00453-016-0237-5openalex-snapshot
Trees, Paths, Stars, Caterpillars and Spiders
inferred← citeshttps://doi.org/10.1007/s10878-013-9680-2openalex-snapshot
Minimum number of disjoint linear forests covering a planar graph
inferred← citeshttps://doi.org/10.1007/s11590-018-1278-2openalex-snapshot
An efficient case for computing minimum linear arboricity with small maximum degree
inferred← citeshttps://doi.org/10.1007/s11786-021-00503-6openalex-snapshot
Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree
inferred← citeshttps://doi.org/10.1016/j.amc.2018.06.007openalex-snapshot
The linear (n−1) -arboricity of some lexicographic product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.04.013openalex-snapshot
On the linear (n−1) -arboricity of Kn(m)
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.006openalex-snapshot
The linear arboricity of K5 -minor free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.067openalex-snapshot
The linear 3-arboricity of Kn,n and Kn
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.023openalex-snapshot
Three ways to cover a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113777openalex-snapshot
On an f-coloring generalization of linear arboricity of multigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113962openalex-snapshot
Decompositions into two linear forests of bounded lengths
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.009openalex-snapshot
Towards the linear arboricity conjecture
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.003openalex-snapshot
The linear arboricity of planar graphs with no short cycles
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00006-0openalex-snapshot
Partitioning into graphs with only small components
inferred← citeshttps://doi.org/10.1090/proc/17684openalex-snapshot
Packing subdivisions into regular graphs
inferred← citeshttps://doi.org/10.1109/ispan-fcst-iscc.2017.41openalex-snapshot
Linear k-Arboricity of Hypohamiltonian Graphs with Small Order
inferred← citeshttps://doi.org/10.1112/jlms.70269openalex-snapshot
Approximate path decompositions of regular graphs
inferred← citeshttps://doi.org/10.1137/090775440openalex-snapshot
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
inferred← citeshttps://doi.org/10.1137/140973013openalex-snapshot
Separation Dimension of Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1137/21m1430492openalex-snapshot
Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings
inferred← citeshttps://doi.org/10.1137/s0895480101394690openalex-snapshot
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
inferred← citeshttps://doi.org/10.1142/s0219265916500080openalex-snapshot
Lineark-Arboricity in Product Networks
inferred← citeshttps://doi.org/10.1145/997817.997868openalex-snapshot
The geometric thickness of low degree graphs
inferred← citeshttps://doi.org/10.1155/2013/501701openalex-snapshot
The Linear 2- and 4-Arboricity of Complete Bipartite Graph Km,n
inferred← citeshttps://doi.org/10.2139/ssrn.7578413openalex-snapshot
The Linear Arboricity of W_5 -minor free graphs
inferred← citeshttps://doi.org/10.2298/aadm150202003zopenalex-snapshot
The linear (n-1)-arboricity of Cartesian product graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-005664983openalex-snapshot
Colorings and transversals of graphs
inferred← citeshttps://doi.org/10.3934/math.2022093openalex-snapshot
The linear $ k $-arboricity of symmetric directed trees
inferred← citeshttps://doi.org/10.3934/math.2022229openalex-snapshot
The linear $ k $-arboricity of digraphs
inferred← citeshttps://doi.org/10.46298/dmtcs.352openalex-snapshot
Queue Layouts of Graph Products and Powers
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5075openalex-snapshot
Separation dimension of bounded degree graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2103.04670openalex-snapshot
Queue layouts and nonrepetitive colouring of planar graphs and powers of trees
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94554openalex-snapshot
Optimization in graphs under degree constraints. application to telecommunication networks
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.