Pages that link to "Item:Q3484848"
From MaRDI portal
The following pages link to Bounds for the vertex linear arboricity (Q3484848):
Displaying 24 items.
- Vertex arboricity and vertex degrees (Q343708) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- The linear arboricity of the Schrijver graph \(SG(2k+2,k)\) (Q411966) (← links)
- Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
- Equitable vertex arboricity of planar graphs (Q514833) (← links)
- The vertex linear arboricity of distance graphs (Q819822) (← links)
- On the relations between arboricity and independent number or covering number (Q1270790) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Linear vertex arboricity, independence number and clique cover number. (Q2716006) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- A QUESTION ON RELAXED EQUITABLE COLORING (Q3166752) (← links)
- On the linear vertex-arboricity of a planar graph (Q3484846) (← links)
- Some results on linear arboricity (Q3795688) (← links)
- On the point linear arboricity of a graph (Q3984223) (← links)
- (Q4379753) (← links)
- A short proof of Brooks’ Theorem for vertex arboricity (Q5154607) (← links)
- Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- An improved bound for the linear arboricity conjecture (Q6081382) (← links)