Orientations and detachments of graphs with prescribed degrees and connectivity
From MaRDI portal
Publication:2339815
Recommendations
Cites work
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3604926 (Why is no real title available?)
- scientific article; zbMATH DE number 842874 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A detachment algorithm for inferring a graph from path frequency
- A matroid approach to finding edge connectivity and packing arborescences
- Connected Detachments of Graphs and Generalized Euler Trails
- Connections in combinatorial optimization
- Edge-Disjoint Spanning Trees of Finite Graphs
- Highly edge-connected detachments of graphs and digraphs
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
- On the Problem of Decomposing a Graph into n Connected Factors
- On the orientation of graphs
Cited in
(6)- Detachment of Vertices of Graphs Preserving Edge-Connectivity
- Highly edge-connected detachments of graphs and digraphs
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
- scientific article; zbMATH DE number 5283505 (Why is no real title available?)
- scientific article; zbMATH DE number 4116573 (Why is no real title available?)
- Tree-compositions and orientations
This page was built for publication: Orientations and detachments of graphs with prescribed degrees and connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339815)