The following pages link to (Q4168622):
Displaying 47 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- Structural properties of recursively partitionable graphs with connectivity 2 (Q505469) (← links)
- Graph decompositions without isolates (Q790844) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs (Q876733) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- A linear algorithm for bipartition of biconnected graphs (Q911298) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- On covering vertices of a graph by trees (Q941380) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Decomposing trees with large diameter (Q986542) (← links)
- Some remarks on \(\lambda _{p,q}\)-connectedness (Q998437) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- On the existence of edge cuts leaving several large components (Q1024487) (← links)
- On the shape of decomposable trees (Q1043555) (← links)
- On spanning tree congestion (Q1044004) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- Fault-tolerant routings in a \(\kappa\)-connected network (Q1109755) (← links)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- Steiner intervals in graphs (Q1382264) (← links)
- The even adjacency split problem for graphs (Q1566571) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- Arc-routing for winter road maintenance (Q2234739) (← links)
- Partitioning the Cartesian product of a tree and a cycle (Q2333226) (← links)
- Decomposition of a 2-connected graph into three connected subgraphs (Q2632546) (← links)
- Communication in m-connected graphs (Q2640619) (← links)
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles (Q3548725) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- An Ore-type condition for arbitrarily vertex decomposable graphs (Q5899376) (← links)
- An Ore-type condition for arbitrarily vertex decomposable graphs (Q5902102) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925672) (← links)
- 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)
- (Q6162644) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
