Eulerian detachments with local edge-connectivity

DOI10.1016/j.dam.2008.08.001zbMath1173.05330OpenAlexW2157751728MaRDI QIDQ1028462

Hiroshi Nagamochi, Takuro Fukunaga

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.001

zbMATH Keywords

Eulerian graphsedge-splittingdetachmentlocal edge-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Some Theorems on Detachments Preserving Local-Edge-Connectivity

Cites Work

• Unnamed Item
• On a theorem of Mader
• A Detachment Algorithm for Inferring a Graph from Path Frequency
• Connected Detachments of Graphs and Generalized Euler Trails
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• A Reduction Method for Edge-Connectivity in Graphs
• Detachments Preserving Local Edge-Connectivity of Graphs
• Highly edge-connected detachments of graphs and digraphs
• Detachment of Vertices of Graphs Preserving Edge-Connectivity
• APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

This page was built for publication: Eulerian detachments with local edge-connectivity