Pages that link to "Item:Q4376499"
From MaRDI portal
The following pages link to On decomposition of triangle-free graphs under degree constraints (Q4376499):
Displaying 38 items.
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Triangle-free circuit decompositions and Petersen minor (Q1272477) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Partitions of multigraphs under minimum degree constraints (Q1730245) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- A generalization of Stiebitz-type results on graph decomposition (Q2034069) (← links)
- Partitions of multigraphs without \(C_4\) (Q2053675) (← links)
- Decomposition of graphs with constraint on minimum degree (Q2172390) (← links)
- Partitions of graphs and multigraphs under degree constraints (Q2181223) (← links)
- A note on partitions of graphs under degree constraints (Q2192117) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- On partitions of graphs under degree constraints (Q2357778) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- On a conjecture of Schweser and Stiebitz (Q2661211) (← links)
- On connected partition with degree constraints (Q2666577) (← links)
- Decompositions of triangle-dense graphs (Q2796209) (← links)
- Internal partitions of regular graphs (Q2825476) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Graph decompositions without isolated vertices III (Q4333457) (← links)
- Decomposing graphs with girth at least five under degree constraints (Q4948751) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH (Q5245703) (← links)
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture (Q5272646) (← links)
- Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints (Q5379812) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
