Constructive characterizations for packing and covering with trees
From MaRDI portal
Publication:1410688
DOI10.1016/S0166-218X(02)00464-XzbMath1022.05071WikidataQ56987165 ScholiaQ56987165MaRDI QIDQ1410688
Publication date: 14 October 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00464-x
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C40: Connectivity
Related Items
The Steiner Problem for Count Matroids, One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory, An inductive construction of minimally rigid body-hinge simple graphs, A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid, The constructive characterization of \((k,l)\)-edge-connected digraphs, A rooted-forest partition with uniform vertex demand, On constructive characterizations of \((k,l)\)-sparse graphs, \(\ell^1\) and \(\ell^\infty\) plane, Graph rigidity for unitarily invariant matrix norms, Sufficient conditions for the global rigidity of graphs, Pebble game algorithms and sparse graphs, An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the orientation of graphs
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- Graph orientations with edge-connection and parity constraints
- On graphs and rigidity of plane skeletal structures
- On the Problem of Decomposing a Graph into n Connected Factors
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Decomposition of Finite Graphs Into Forests