Locally Hamiltonian graphs and minimal size of maximal graphs on a surface (Q2185215): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:29, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Locally Hamiltonian graphs and minimal size of maximal graphs on a surface |
scientific article |
Statements
Locally Hamiltonian graphs and minimal size of maximal graphs on a surface (English)
0 references
4 June 2020
0 references
A graph \(G\) is called locally Hamiltonian if for each vertex \(v\) of \(G\) the subgraph induced by the neighborhood of \(v\) is Hamiltonian. The main result of the paper states: Every locally Hamiltonian multigraph \(G\) on \(n\) vertices, with no loops, has at least \(3n-6\) edges. The equality is attained iff \(G\) triangulates the sphere. Several consequence of this deep result are given as well.
0 references
locally Hamiltonian graph
0 references
minimal size of maximal graph on a surface
0 references
