Orientations and detachments of graphs with prescribed degrees and connectivity
DOI10.1016/J.DISOPT.2014.02.003zbMATH Open1308.05054OpenAlexW2000661552MaRDI QIDQ2339815FDOQ2339815
Authors: Satoru Iwata, Tibor Jordán 
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.02.003
Recommendations
Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Connections in combinatorial optimization
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Title not available (Why is that?)
- A detachment algorithm for inferring a graph from path frequency
- Title not available (Why is that?)
- A matroid approach to finding edge connectivity and packing arborescences
- Connected Detachments of Graphs and Generalized Euler Trails
- On the orientation of graphs
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
- Title not available (Why is that?)
- Highly edge-connected detachments of graphs and digraphs
Cited In (6)
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)
