Connected Detachments of Graphs and Generalized Euler Trails

From MaRDI portal
Publication:3691708

DOI10.1112/jlms/s2-31.1.17zbMath0574.05042OpenAlexW2095645574MaRDI QIDQ3691708

C. St. J. A. Nash-Williams

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

Hamiltonian decompositions of complete regular s-partite graphsAmalgamations of factorizations of complete equipartite graphsMultiply balanced edge colorings of multigraphsHighly edge-connected detachments of graphs and digraphsAmalgamations of almost regular edge-colourings of simple graphsAntistrong digraphsDecomposing highly edge-connected graphs into paths of any given lengthAmalgamations of factorizations of complete graphsAmalgamations of connected \(k\)-factorizations.Non-separable detachments of graphsParity in knot theory and graph-linksThe embedding of partial triple systems when 4 divides \(\lambda\)Another proof of a theorem concerning detachments of graphsOutline symmetric Latin squaresSigned Graphs: From Modulo Flows to Integer-Valued FlowsDetachments of Amalgamated 3‐Uniform Hypergraphs Factorization ConsequencesDecomposing highly connected graphs into paths of length fiveAntiparallel \(d\)-stable traces and a stronger version of ore problemSubmodular function minimizationAlgebraic Algorithms for Linear Matroid Parity ProblemsA detachment algorithm for inferring a graph from path frequencyEulerian detachments with local edge-connectivityFractional latin squares, simplex algebras, and generalized quotientsOn flows in bidirected graphsInteger Flows and Modulo Orientations of Signed GraphsOrientations and detachments of graphs with prescribed degrees and connectivitySome Theorems on Detachments Preserving Local-Edge-Connectivity