z-logo
Premium
Removable Cycles in Planar Graphs
Author(s) -
Fleischner Herbert,
Jackson Bill
Publication year - 1985
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-31.2.193
Subject(s) - citation , planar graph , combinatorics , library science , computer science , mathematics , graph
Soit G un graphe planaire, 2-connexe de degre minimum au moins 4. Alors G contient un cycle C tel que G-E(C) est 2-connexe

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here