Connected Detachments of Graphs and Generalized Euler Trails
From MaRDI portal
Publication:3691708
DOI10.1112/jlms/s2-31.1.17zbMath0574.05042OpenAlexW2095645574MaRDI QIDQ3691708
Publication date: 1985
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-31.1.17
Related Items (27)
Hamiltonian decompositions of complete regular s-partite graphs ⋮ Amalgamations of factorizations of complete equipartite graphs ⋮ Multiply balanced edge colorings of multigraphs ⋮ Highly edge-connected detachments of graphs and digraphs ⋮ Amalgamations of almost regular edge-colourings of simple graphs ⋮ Antistrong digraphs ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Amalgamations of factorizations of complete graphs ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Non-separable detachments of graphs ⋮ Parity in knot theory and graph-links ⋮ The embedding of partial triple systems when 4 divides \(\lambda\) ⋮ Another proof of a theorem concerning detachments of graphs ⋮ Outline symmetric Latin squares ⋮ Signed Graphs: From Modulo Flows to Integer-Valued Flows ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Decomposing highly connected graphs into paths of length five ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ Submodular function minimization ⋮ Algebraic Algorithms for Linear Matroid Parity Problems ⋮ A detachment algorithm for inferring a graph from path frequency ⋮ Eulerian detachments with local edge-connectivity ⋮ Fractional latin squares, simplex algebras, and generalized quotients ⋮ On flows in bidirected graphs ⋮ Integer Flows and Modulo Orientations of Signed Graphs ⋮ Orientations and detachments of graphs with prescribed degrees and connectivity ⋮ Some Theorems on Detachments Preserving Local-Edge-Connectivity
This page was built for publication: Connected Detachments of Graphs and Generalized Euler Trails
