Nested Locally Hamiltonian Graphs and the Oberly-Sumner Conjecture
A graph G is locally 𝒫, abbreviated L𝒫, if for every vertex v in G the open neighbourhood N(v) of v is non-empty and induces a graph with property 𝒫. Specifically, a graph G without isolated vertices is locally connected (LC) if N(v) induces a connected graph for each v ∈ V (G), and locally hamilton...
Main Authors: | de Wet Johan P., Frick Marietjie |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2346 |
Similar Items
-
Improved Sufficient Conditions for Hamiltonian Properties
by: Bode Jens-P., et al.
Published: (2015-05-01) -
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
by: Tang Long, et al.
Published: (2020-02-01) -
Traceability of locally hamiltonian and locally traceable graphs
by: Johan De Wet, et al.
Published: (2016-07-01) -
Hyper-Hamiltonian circulants
by: Zbigniew R. Bogdanowicz
Published: (2021-04-01) -
Energy Conditions for Hamiltonian and Traceable Graphs
by: Rao Li
Published: (2019-03-01)