Bounds for the vertex linear arboricity
From MaRDI portal
DOI10.1002/JGT.3190140113zbMATH Open0705.05018OpenAlexW2102797028MaRDI QIDQ3484848FDOQ3484848
Authors: Makoto Matsumoto 
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140113
Recommendations
Cited In (24)
- The vertex linear arboricity of distance graphs
- The linear arboricity of the Schrijver graph \(SG(2k+2,k)\)
- Bounds of the sum of edge lengths in linear arrangements of trees
- On the relations between arboricity and independent number or covering number
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Some results on linear arboricity
- Title not available (Why is that?)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
- A short proof of Brooks’ Theorem for vertex arboricity
- Vertex-arboricity of planar graphs without intersecting triangles
- A question on relaxed equitable coloring
- The Complexity of Drawing Graphs on Few Lines and Few Planes
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- A sequential coloring algorithm for finite sets
- Vertex arboricity and vertex degrees
- Vertex arboricity and maximum degree
- Drawing Graphs on Few Lines and Few Planes
- On the linear vertex-arboricity of a planar graph
- The linear \(k\)-vertex-arboricity of Halin graph
- A note on relaxed equitable coloring of graphs
- Cover and variable degeneracy
- An improved bound for the linear arboricity conjecture
- Linear vertex arboricity, independence number and clique cover number.
- Equitable vertex arboricity of planar graphs
This page was built for publication: Bounds for the vertex linear arboricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484848)
