Panconnected graphs. II

DOI10.1007/BF02018497zbMath0339.05110MaRDI QIDQ1230793

James E. Williamson

Publication date: 1977

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Vertex pancyclic graphs ⋮ Locating pairs of vertices on a Hamiltonian cycle in bigraphs ⋮ Minimum Degrees for Powers of Paths and Cycles ⋮ Geodesic-pancyclic graphs ⋮ Distributing pairs of vertices on Hamiltonian cycles ⋮ Unnamed Item ⋮ A panconnectivity theorem for bipartite graphs ⋮ Precise location of vertices on Hamiltonian cycles ⋮ Minimum degree condition for proper connection number 2 ⋮ The Ramsey number of a long even cycle versus a star ⋮ Proper connection of graphs ⋮ Locating pairs of vertices on Hamiltonian cycles ⋮ Degree sum and graph linkage with prescribed path lengths ⋮ On cycles that alternate through selected sets of vertices ⋮ Subdivisions of graphs: A generalization of paths and cycles ⋮ Enomoto and Ota's conjecture holds for large graphs ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Note on locating pairs of vertices on Hamiltonian cycles ⋮ Minimum degree and pan-\(k\)-linked graphs ⋮ Distributing vertices on Hamiltonian cycles ⋮ Highly Irregular ⋮ An anti-Ramsey theorem on cycles ⋮ On \(k\)-path pancyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Hamilton connected graphs
• A generalization of hamiltonian-connected graphs
• Nonhamiltonian connected graphs
• On Hamilton's ideals
• A note on Hamiltonian circuits
• Theory of path length distributions. I
• Note on Hamilton Circuits
• On a Problem of Ore
• A sufficient condition for hamiltonian connectedness
• Variations on the Hamiltonian Theme
• Some Theorems on Abstract Graphs