Orientations and detachments of graphs with prescribed degrees and connectivity

DOI10.1016/j.disopt.2014.02.003zbMath1308.05054OpenAlexW2000661552MaRDI QIDQ2339815

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

graphspanning treeorientationdetachmentarborescence

Mathematics Subject Classification ID

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

Cites Work

• Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
• A detachment algorithm for inferring a graph from path frequency
• On the orientation of graphs
• A matroid approach to finding edge connectivity and packing arborescences
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• Highly edge-connected detachments of graphs and digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Orientations and detachments of graphs with prescribed degrees and connectivity