Toughness and longest cycles in 2-connected planar graphs

T. Bohme, H.J. Broersma, H.J. Veldman

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

330 Downloads (Pure)

Access to Document

@article{79778a1df49040ffa2478e6f93922cb8,

title = "Toughness and longest cycles in 2-connected planar graphs",

author = "T. Bohme and H.J. Broersma and H.J. Veldman",

year = "1996",

doi = "10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R",

language = "English",

volume = "23",

pages = "257--263",

journal = "Journal of graph theory",

issn = "0364-9024",

publisher = "Wiley",

number = "3",

}

TY - JOUR

T1 - Toughness and longest cycles in 2-connected planar graphs

AU - Bohme, T.

AU - Broersma, H.J.

AU - Veldman, H.J.

PY - 1996

Y1 - 1996

U2 - 10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R

DO - 10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R

M3 - Article

SN - 0364-9024

VL - 23

SP - 257

EP - 263

JO - Journal of graph theory

JF - Journal of graph theory

IS - 3

ER -