Orientations and detachments of graphs with prescribed degrees and connectivity

DOI10.1016/J.DISOPT.2014.02.003MaRDI QIDQ2339815zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

arborescencedetachmentgraphorientationspanning tree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Highly edge-connected detachments of graphs and digraphs
• scientific article; zbMATH DE number 2248469
• Detachments Preserving Local Edge-Connectivity of Graphs
• Some Theorems on Detachments Preserving Local-Edge-Connectivity
• Non-separable detachments of graphs

Cites work

• 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
• 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?)
• Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
• On the orientation of graphs
• On the Problem of Decomposing a Graph into n Connected Factors

Cited in

(6)

• Tree-compositions and orientations
• 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?)
• Highly edge-connected detachments of graphs and digraphs
• Detachment of Vertices of Graphs Preserving Edge-Connectivity

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)