Pages that link to "Item:Q5379812"
From MaRDI portal
The following pages link to Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints (Q5379812):
Displaying 11 items.
- 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)
- 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 a conjecture of Schweser and Stiebitz (Q2661211) (← links)
- On connected partition with degree constraints (Q2666577) (← links)
- (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
- A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
