scientific article
From MaRDI portal
Publication:3222861
zbMath0558.05019MaRDI QIDQ3222861
Alan M. Frieze, Trevor I. Fenner
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pathsHamiltonian cyclesperfect matchingsedge colouringspanning arborescencesspanning treescutsetsrecognition algorithmpolychromatic subsets
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) ⋮ Anti-Ramsey properties of random graphs
