z-logo
Premium
Contractions and hamiltonian line graphs
Author(s) -
Lai HongJian
Publication year - 1988
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.3190120103
Subject(s) - mathematics , combinatorics , hamiltonian (control theory) , line graph , hamiltonian path , discrete mathematics , graph , mathematical optimization
Using the contraction method, we find a best possible condition involving the minimum degree for a triangle‐free graph to have a spanning eulerian subgraph.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here