Constrained Cycle Covers in Halin Graphs
From MaRDI portal
Publication:3611908
DOI10.1007/978-3-540-74450-4_17zbMath1176.90609OpenAlexW1606850606MaRDI QIDQ3611908
Publication date: 3 March 2009
Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_17
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Constrained Cycle Covers in Halin Graphs