The following pages link to (Q4715286):
Displaying 50 items.
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- A note on a cycle partition problem (Q533476) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- What is on his mind? (Q709300) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Graph decompositions without isolates (Q790844) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- Non-separating subgraphs in highly connected graphs (Q905893) (← links)
- Standardization of perspectives into degree-splitting graph of a graph (Q972967) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- On some open problems concerning quorum colorings of graphs (Q1671350) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
- Weak internal partition of regular graphs (Q1690616) (← 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 splitting digraphs (Q1750217) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← 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)
- Graph decompositions without isolated vertices (Q1892833) (← 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)
- A note on the satisfactory partition problem: constant size requirement (Q2094373) (← links)
- Some remarks on even-hole-free graphs (Q2161221) (← 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)
- On 1-factors with prescribed lengths in tournaments (Q2284736) (← links)
- Decomposing a graph into two subgraphs with prescribed parities of vertex degrees (Q2286313) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- On partitions of graphs under degree constraints (Q2357778) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- The extremal function for disconnected minors (Q2399354) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- The satisfactory partition problem (Q2495904) (← 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)
- Partition and disjoint cycles in digraphs (Q2698538) (← links)
