The following pages link to (Q4715286):
Displaying 19 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)
- 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)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- On some open problems concerning quorum colorings of graphs (Q1671350) (← 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)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
