Premium
Hamiltonian properties of domination‐critical graphs
Author(s) -
Wojcicka Ewa
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190140209
Subject(s) - mathematics , combinatorics , hamiltonian (control theory) , discrete mathematics , mathematical optimization
Abstract In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.