Pages that link to "Item:Q5890907"

The following pages link to Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907):

Displaying 31 items.

• Minimum size of feedback vertex sets of planar graphs of girth at least five (Q730261) (← links)
• Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
• Simple planar graph partition into three forests (Q1392570) (← links)
• Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
• Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
• Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
• On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
• Partition into triangles on bounded degree graphs (Q2392247) (← links)
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree (Q2481185) (← links)
• Partitions of some planar graphs into two linear forests (Q4209936) (← links)
• (Q4996553) (← links)
• Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
• (Q5284057) (← links)
• Note on partitions of planar graphs (Q5316274) (← links)
• (Q5878782) (← links)
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
• (Q5920083) (redirect page) (← links)
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
• An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
• Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)
• Partitioning planar graph of girth 5 into two forests with maximum degree 4. (Q6584423) (← links)
• Partitioning planar graphs into bounded degree forests (Q6585546) (← links)
• Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)