Pages that link to "Item:Q3816108"
From MaRDI portal
The following pages link to On partitioning the edges of graphs into connected subgraphs (Q3816108):
Displaying 35 items.
- Decomposing series-parallel graphs into paths of length 3 and triangles (Q322267) (← links)
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- What is on his mind? (Q709300) (← links)
- The Ryjáček closure and a forbidden subgraph (Q726640) (← links)
- Chain packing in graphs (Q808291) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Brick partitions of graphs (Q960924) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
- Graphs and digraphs with given girth and connectivity (Q1336679) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- A graph partition problem (Q1367109) (← links)
- A note on edge-decompositions of planar graphs (Q1827795) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Arc-routing for winter road maintenance (Q2234739) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Deficiency and forbidden subgraphs of connected, locally-connected graphs (Q2282473) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- A pair of forbidden subgraphs and perfect matchings. (Q2490834) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- Decompositions of highly connected graphs into paths of length 3 (Q3630834) (← links)
- (Q3758879) (← links)
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm (Q5091037) (← links)
- Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian (Q5163018) (← links)
- (Q5233771) (← links)
- Star decomposition of graphs (Q5261050) (← links)
- (Q5708525) (← links)
- Counting connected partitions of graphs (Q6606326) (← links)
