Degrees in Homogeneously Traceable Graphs

DOI10.1016/S0167-5060(08)70871-9MaRDI QIDQ3890728zbMATH OpenOpenAlexFDO

Authors Zdzisław Skupień

Publication date 1980

Published in Combinatorics 79 Part I (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70871-9

zbMATH Keywords

Hamiltonian homogeneously traceable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cited in

(7)

• On detour homogeneous digraphs
• A catalogue of small maximal nonhamiltonian graphs
• Maximum nonhamiltonian tough graphs
• Regular homogeneously traceable nonhamiltonian graphs
• Construction of regular homogeneously traceable nonhamiltonian graphs
• The Petersen and heawood graphs make up graphical twins via induced matchings
• Nontraceable detour graphs

This page was built for publication: Degrees in Homogeneously Traceable Graphs

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