Pages that link to "Item:Q1003834"
From MaRDI portal
The following pages link to Covering planar graphs with forests, one having bounded maximum degree (Q1003834):
Displaying 32 items.
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (Q602728) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Decomposing plane cubic graphs (Q896062) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- On the game coloring index of \(F^+\)-decomposable graphs (Q1693133) (← links)
- Facial packing vertex-coloring of subdivided plane graphs (Q1730225) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
- Covering projective planar graphs with three forests (Q2075505) (← links)
- Towards obtaining a 3-decomposition from a perfect matching (Q2094896) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait (Q2171018) (← links)
- Bounds on the number of closed walks in a graph and its applications (Q2405633) (← links)
- Decomposing a planar graph into a forest and a subgraph of restricted maximum degree (Q2481185) (← links)
- Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)
- Degree Bounded Forest Covering (Q3009772) (← links)
- Cover and partition of pre-maximal plane graphs (Q3987834) (← links)
- (Q4414510) (← links)
- (Q4526640) (← links)
- Spectral Radius of Graphs (Q4557578) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs (Q6108003) (← links)
- Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions (Q6494943) (← links)
