Pages that link to "Item:Q1907105"
From MaRDI portal
The following pages link to Decomposing a planar graph into degenerate graphs (Q1907105):
Displaying 29 items.
- From the plane to higher surfaces (Q444375) (← links)
- Maximum 4-degenerate subgraph of a planar graph (Q490312) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- On a cycle partition problem (Q998373) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Equitable partition of planar graphs (Q2022132) (← links)
- Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- An extension of Thomassen's result on choosability (Q2139819) (← links)
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Cycle partition of two-connected and two-edge connected graphs (Q2516513) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- New upper bounds on the decomposability of planar graphs (Q3376690) (← links)
- (Q4882550) (← links)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- 3‐Degenerate induced subgraph of a planar graph (Q6056810) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
- The high order spectrum of a graph and its applications in graph colouring and clique counting (Q6133767) (← links)
- Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)
- Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles (Q6611063) (← links)
