z-logo
Premium
Hamiltonian properties of domination‐critical graphs
Author(s) -
Wojcicka Ewa
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - English
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
In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom