Graph threading

DOI10.4230/LIPICS.ITCS.2024.38MaRDI QIDQ6906397zbMATH OpenFDO

Authors Erik D. Demaine, Yael Kirkpatrick, Rebecca Lin

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.38

zbMATH Keywords

beadingEulerian cycleperfect matchingshortest walk

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An O(EV\log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
• An upper bound on the sum of squares of degrees in a graph
• Arboricity and Subgraph Listing Algorithms
• Efficient algorithms for Petersen's matching theorem
• Eulerian graphs and related topics. Part 1, Volume 1
• Graph theory with applications
• Perfect matchings in planar cubic graphs

This page was built for publication: Graph threading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906397)