Hamiltonian labelings of graphs

DOI10.2140/INVOLVE.2009.2.95zbMATH Open1167.05024OpenAlexW2124435949MaRDI QIDQ2390635FDOQ2390635

Ping Zhang, Willem Renzema

Publication date: 31 July 2009

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2009.2.95

zbMATH Keywords

detour distanceHamiltonian labelingHamiltonian labeling number

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Logical Approach to Hamiltonian Graphs
• Hamiltonian and Lagrangian bond graphs
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3

This page was built for publication: Hamiltonian labelings of graphs

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