An ILP Approach to Determine Smallest 4-Regular Non-Hamiltonian, Nontraceable, and Nonhomogeneously Traceable Graphs

In this paper we study some open questions related to the smallest order of a -regular graph which has a connectivity property but does not have a hamiltonian property . In particular, is either connectivity, -connectivity or -toughness and is hamiltonicity, homogeneous traceability or traceability....

Full description

Saved in:

Bibliographic Details
Published in:	Journal of applied and industrial mathematics Vol. 16; no. 2; pp. 252 - 266
Main Authors:	Lancia, G., Pippia, E., Rinaldi, F.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 2022 Springer Nature B.V
Subjects:	Apexes Connectivity Graph theory Graphs Integer programming Linear functions Linear programming Mathematics Mathematics and Statistics Questions Toughness Hamiltonian graph traceable graph branch-and-cut 4-regular graph 1-tough graph Integer Linear Programming homogeneously traceable graph
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!