Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem

DOI10.3233/FI-2012-711zbMath1244.05173OpenAlexW1498196328WikidataQ115198425 ScholiaQ115198425MaRDI QIDQ2898470

Jacek Błażewicz, Marta Kasprzak

Publication date: 11 July 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2012-711

zbMATH Keywords

digraphsHamiltonian circuit problemgraph reductionquasi-adjoint graphsdirected line graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Classification of de Bruijn-based labeled digraphs

This page was built for publication: Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem