Pages that link to "Item:Q1850567"
From MaRDI portal
The following pages link to Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567):
Displaying 15 items.
- From the plane to higher surfaces (Q444375) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← 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)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← 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 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)
