Hamiltonian completion

MaRDI QIDQ2906904zbMATH OpenFDO

Authors Oleg Valerievich Maksimovich, Regina Iosifovna Tyshkevich

Publication date 5 September 2012

Published in Trudy Instituta Matematiki (Search for Journal in Brave)

zbMATH Keywords

edge distance of graphshamiltonian cycle probleminjective-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2170468
• Hamiltonian colorings of graphs
• Hamiltonian extension
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• Hamiltonian completions of sparse random graphs

This page was built for publication: Hamiltonian completion

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