On the public citation graph

The linear arboricity of graphs

0 signed · 147 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190080211openalex-snapshot
The linear arboricity of some regular graphs
inferredcites →https://doi.org/10.1002/jgt.3190100408openalex-snapshot
Some results on linear arboricity
inferredcites →https://doi.org/10.1002/net.3230110108openalex-snapshot
Covering and packing in graphs IV: Linear arboricity
inferredcites →https://doi.org/10.1002/net.3230170104openalex-snapshot
Linear arboricity of digraphs
inferredcites →https://doi.org/10.1007/3-540-10704-5_4openalex-snapshot
A status on the linear arboricity
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-2130-2_6openalex-snapshot
Infinite and Finite Sets
inferredcites →https://doi.org/10.1007/bf02392606openalex-snapshot
Die Theorie der regulären graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90209-6openalex-snapshot
Some problems about linear arboricity
inferredcites →https://doi.org/10.1016/0012-365x(84)90075-xopenalex-snapshot
On linear k-arboricity
inferredcites →https://doi.org/10.1016/0012-365x(89)90073-3openalex-snapshot
The star arboricity of graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73403-0openalex-snapshot
La k-Arboricité Linéaire Des Arbres
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45132.xopenalex-snapshot
COVERING AND PACKING IN GRAPHS, I.
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1201/9780429425134openalex-snapshot
Graph Theory and Its Applications

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(199906)31:2<129::aid-jgt5>3.0.co;2-aopenalex-snapshot
On the linear arboricity of planar graphs
inferred← citeshttps://doi.org/10.1002/9781118032497.ch4openalex-snapshot
Degrees
inferred← citeshttps://doi.org/10.1002/jgt.20300openalex-snapshot
An improved bound for the strong chromatic number
inferred← citeshttps://doi.org/10.1002/jgt.20592openalex-snapshot
A Planar linear arboricity conjecture
inferred← citeshttps://doi.org/10.1002/jgt.20618openalex-snapshot
Bounded transversals in multipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.22004openalex-snapshot
Eigenvalues of ‐Free Graphs and the Connectivity of Their Independence Complexes
inferred← citeshttps://doi.org/10.1002/jgt.22416openalex-snapshot
Bounded diameter arboricity
inferred← citeshttps://doi.org/10.1002/jgt.22685openalex-snapshot
The list linear arboricity of graphs
inferred← citeshttps://doi.org/10.1002/jgt.22800openalex-snapshot
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
inferred← citeshttps://doi.org/10.1002/jgt.22830openalex-snapshot
On the path partition number of 6‐regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.22876openalex-snapshot
Graphs of low average degree without independent transversals
inferred← citeshttps://doi.org/10.1002/jgt.22967openalex-snapshot
Linear arboricity of degenerate graphs
inferred← citeshttps://doi.org/10.1002/jgt.22995openalex-snapshot
Partitioning edges of a planar graph into linear forests and a matching
inferred← citeshttps://doi.org/10.1002/jgt.23040openalex-snapshot
A decomposition method on solving the linear arboricity conjecture
inferred← citeshttps://doi.org/10.1002/jgt.23085openalex-snapshot
Degree criteria and stability for independent transversals
inferred← citeshttps://doi.org/10.1002/rsa.21051openalex-snapshot
Colorings, transversals, and local sparsity
inferred← citeshttps://doi.org/10.1002/rsa.21181openalex-snapshot
Packing list‐colorings
inferred← citeshttps://doi.org/10.1002/rsa.3240010405openalex-snapshot
Linear arboricity of random regular graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240020303openalex-snapshot
Acyclic coloring of graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240020402openalex-snapshot
An algorithmic approach to the Lovász local lemma. I
inferred← citeshttps://doi.org/10.1002/rsa.3240020403openalex-snapshot
A parallel algorithmic version of the local lemma
inferred← citeshttps://doi.org/10.1002/rsa.3240030102openalex-snapshot
The strong chromatic number of a graph
inferred← citeshttps://doi.org/10.1007/11549345_29openalex-snapshot
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
inferred← citeshttps://doi.org/10.1007/11671541_11openalex-snapshot
The Lovász-Local-Lemma and Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_36openalex-snapshot
Planar Projections of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_30openalex-snapshot
The Linear Arboricity Conjecture for 3-Degenerate Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_31openalex-snapshot
Path Decompositions of Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_9openalex-snapshot
Independent transversals and hypergraph matchings - an elementary approach
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-319-44479-6_2openalex-snapshot
Fair Representation by Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_63openalex-snapshot
Inapproximability of Maximal Strip Recovery
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_19openalex-snapshot
A Planar Linear Arboricity Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_17openalex-snapshot
Recognizing d-Interval Graphs and d-Track Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_1openalex-snapshot
The Probabilistic Method
inferred← citeshttps://doi.org/10.1007/bf02351587openalex-snapshot
A note on the arboricity of graphs
inferred← citeshttps://doi.org/10.1007/bfb0090055openalex-snapshot
Probabilistic proofs of existence of rare events
inferred← citeshttps://doi.org/10.1007/pl00007233openalex-snapshot
Linear Arboricity and Linear k-Arboricity of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-007-0720-5openalex-snapshot
Jin Akiyama: A Friend and His Mathematics
inferred← citeshttps://doi.org/10.1007/s00446-017-0303-5openalex-snapshot
Reliable Communication over Highly Connected Noisy Networks
inferred← citeshttps://doi.org/10.1007/s00453-012-9651-5openalex-snapshot
Recognizing d-Interval Graphs and d-Track Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0237-5openalex-snapshot
Trees, Paths, Stars, Caterpillars and Spiders
inferred← citeshttps://doi.org/10.1007/s00493-006-0019-9openalex-snapshot
Extremal Problems For Transversals In Graphs With Bounded Degree
inferred← citeshttps://doi.org/10.1007/s00493-023-00024-9openalex-snapshot
An Improved Bound for the Linear Arboricity Conjecture
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.1007/s11856-020-1980-5openalex-snapshot
Fair splittings by independent sets in sparse graphs
inferred← citeshttps://doi.org/10.1007/s40840-025-01884-8openalex-snapshot
On the Triple Arboricity of Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90073-3openalex-snapshot
The star arboricity of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90377-eopenalex-snapshot
Decompositions of graphs into forests with bounded maximum degree
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00465-4openalex-snapshot
Probabilistic methods in coloring and decomposition problems
inferred← citeshttps://doi.org/10.1016/0893-9659(91)90054-yopenalex-snapshot
Upper bound for linear arboricity
inferred← citeshttps://doi.org/10.1016/0893-9659(94)90055-8openalex-snapshot
Acyclic edge-colorings of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102163openalex-snapshot
Entropy compression versus Lovász Local Lemma
inferred← citeshttps://doi.org/10.1016/j.aim.2024.109984openalex-snapshot
Hamilton cycles in pseudorandom graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124565openalex-snapshot
The list linear arboricity of planar graphs with 7-cycles containing at most two chords
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.005openalex-snapshot
On graph thickness, geometric thickness, and separator theorems
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.015openalex-snapshot
Planar projections of graphs
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.2016.11.022openalex-snapshot
An introduction to the discharging method via graph coloring
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112434openalex-snapshot
The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
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.2025.114696openalex-snapshot
A reduction of the “cycles plus K4's” problem
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115078openalex-snapshot
Path odd-covers of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.004openalex-snapshot
Polynomial treewidth forces a large grid-like-minor
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.011openalex-snapshot
Optimal path and cycle decompositions of dense quasirandom graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.002openalex-snapshot
Incidence coloring of Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.02.003openalex-snapshot
Independent transversals in locally sparse graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.01.004openalex-snapshot
Optimal path and cycle decompositions of dense quasirandom graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.009openalex-snapshot
Towards the linear arboricity conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.004openalex-snapshot
An average degree condition for independent transversals
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.07.005openalex-snapshot
Approximate packing of independent transversals in locally sparse graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2008.11.003openalex-snapshot
Finding occurrences of protein complexes in protein–protein interaction graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.021openalex-snapshot
Inapproximability of maximal strip recovery
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00227-9openalex-snapshot
Problems and results in extremal combinatorics—I
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00193-3openalex-snapshot
Factorisation of regular graphs into forests of short paths
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00006-0openalex-snapshot
Partitioning into graphs with only small components
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00247-4openalex-snapshot
Linear k-arboricities on trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511721335.010openalex-snapshot
Models of Random Regular Graphs
inferred← citeshttps://doi.org/10.1017/s0963548300001632openalex-snapshot
Almost Every Graph can be Covered by Linear Forests
inferred← citeshttps://doi.org/10.1017/s0963548301004758openalex-snapshot
A Note on Vertex List Colouring
inferred← citeshttps://doi.org/10.1017/s0963548304006157openalex-snapshot
On the Strong Chromatic Number
inferred← citeshttps://doi.org/10.1017/s0963548305007157openalex-snapshot
Odd Independent Transversals are Odd
inferred← citeshttps://doi.org/10.1017/s0963548307008607openalex-snapshot
On the Strong Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548318000561openalex-snapshot
An asymptotic bound for the strong chromatic number
inferred← citeshttps://doi.org/10.1017/s0963548320000127openalex-snapshot
Finding independent transversals efficiently
inferred← citeshttps://doi.org/10.1017/s0963548322000141openalex-snapshot
Complete subgraphs in a multipartite graph
inferred← citeshttps://doi.org/10.1090/proc/16924openalex-snapshot
Optimal Hamilton covers and linear arboricity for random graphs
inferred← citeshttps://doi.org/10.1090/tran/9455openalex-snapshot
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
inferred← citeshttps://doi.org/10.1093/imrn/rnaf215openalex-snapshot
Cyclic Subsets in Regular Dirac Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.57openalex-snapshot
The Moser--Tardos Framework with Partial Resampling
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.1109/sfcs.1991.185423openalex-snapshot
A parallel algorithmic version of the local lemma
inferred← citeshttps://doi.org/10.1112/jlms/jdv062openalex-snapshot
If (A+A)/(A+A) is small, then the ratio set is large
inferred← citeshttps://doi.org/10.1112/plms.12480openalex-snapshot
Path decompositions of tournaments
inferred← citeshttps://doi.org/10.1137/0403018openalex-snapshot
Transversals of Vertex Partitions in Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch140openalex-snapshot
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution
inferred← citeshttps://doi.org/10.1137/1.9781611976465.41openalex-snapshot
Algorithms for weighted independent transversals and strong colouring
inferred← citeshttps://doi.org/10.1137/1.9781611977073.71openalex-snapshot
Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1137/s0097539792232021openalex-snapshot
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
inferred← citeshttps://doi.org/10.1142/s0219265916500080openalex-snapshot
Lineark-Arboricity in Product Networks
inferred← citeshttps://doi.org/10.1145/129712.129727openalex-snapshot
Existence and construction of edge disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/2488608.2488696openalex-snapshot
Constraint satisfaction, packet routing, and the lovasz local lemma
inferred← citeshttps://doi.org/10.1145/3474057openalex-snapshot
Algorithms for Weighted Independent Transversals and Strong Colouring
inferred← citeshttps://doi.org/10.1145/3711896.3736921openalex-snapshot
Efficient Bitruss Decomposition without Butterfly Enumeration
inferred← citeshttps://doi.org/10.1145/3711896.3736950openalex-snapshot
Fair Diversity Maximization with Few Representatives
inferred← citeshttps://doi.org/10.1145/997817.997868openalex-snapshot
The geometric thickness of low degree graphs
inferred← citeshttps://doi.org/10.11650/tjm.3.1999.1309openalex-snapshot
ALGORITHMIC ASPECTS OF LINEAR k-ARBORICITY
inferred← citeshttps://doi.org/10.11650/twjm/1500407055openalex-snapshot
ALGORITHMIC ASPECTS OF LINEAR k-ARBORICITY
inferred← citeshttps://doi.org/10.1201/b16132-22openalex-snapshot
Chinese Postman Problems
inferred← citeshttps://doi.org/10.1201/b16132-32openalex-snapshot
Factors and Factorization
inferred← citeshttps://doi.org/10.2139/ssrn.7578413openalex-snapshot
The Linear Arboricity of W_5 -minor free graphs
inferred← citeshttps://doi.org/10.3233/fun-2006-70405openalex-snapshot
Indexing Schemes for Similarity Search: an Illustrated Paradigm
inferred← citeshttps://doi.org/10.37236/12429openalex-snapshot
Constructing Graphs with No Independent Transversals
inferred← citeshttps://doi.org/10.3929/ethz-a-005664983openalex-snapshot
Colorings and transversals of graphs
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.118.09.777openalex-snapshot
On Forming Committees
inferred← citeshttps://doi.org/10.46298/dmtcs.352openalex-snapshot
Queue Layouts of Graph Products and Powers
inferred← citeshttps://doi.org/10.48550/arxiv.1008.3190openalex-snapshot
Partitions and Coverings of Trees by Bounded-Degree Subtrees
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4434openalex-snapshot
An Introduction to the Discharging Method via Graph Coloring
inferred← citeshttps://doi.org/10.48550/arxiv.1509.04638openalex-snapshot
A local lemma via entropy compression
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04121openalex-snapshot
Line k-Arboricity in Product Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06672openalex-snapshot
Derandomizing the Lovasz Local Lemma via log-space statistical tests
inferred← citeshttps://doi.org/10.48550/arxiv.2003.05233openalex-snapshot
Colourings, transversals and local sparsity
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06066openalex-snapshot
The linear arboricity conjecture for graphs of low degeneracy
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.48550/arxiv.cs/0211018openalex-snapshot
Indexing schemes for similarity search: an illustrated paradigm
inferred← citeshttps://doi.org/10.54691/weh1rn52openalex-snapshot
The Linear Arboricity of IC-planar 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.