Degree sums for edges and cycle lengths in graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199708)25:4<253::AID-JGT2>3.0.CO;2-J" /><253::AID-JGT2>3.0.CO;2-J 10.1002/(SICI)1097-0118(199708)25:4<253::AID-JGT2>3.0.CO;2-JzbMath0876.05056OpenAlexW2739288616MaRDI QIDQ4351312

Stephan Brandt, Henk Jan Veldman

Publication date: 3 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199708)25:4<253::aid-jgt2>3.0.co;2-j

zbMATH Keywords

circumferencedegree sumindependent deficiency

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Hamiltonicity of edge-chromatic critical graphs ⋮ Toughness in graphs -- a survey ⋮ On the circumference of a graph and its complement

This page was built for publication: Degree sums for edges and cycle lengths in graphs