ExLibris header image
SFX Logo
Title: A recursive characterization of the 4-connected graphs
Source:

Discrete Mathematics [0012-365X] Martinov, Nicola yr:1990


Collapse list of basic services Basic
Full text
Full text available via EZB-NALI5-00465 Elsevier Archive NL
GO
Document delivery
Request document via Library/Bibliothek GO
Users interested in this article also expressed an interest in the following:
1. Ando, K. "Vertices of degree 5 in a contraction critically 5-connected graph." Graphs and Combinatorics 21.1 (2005): 27-37. Link to SFX for this item
2. Ando, K. "Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph." Discrete mathematics 309.22 (2009): 6359-6367. Link to SFX for this item
3. Mader, W. "High connectivity keeping sets in n-connected graphs." Combinatorica 24.3 (2004): 441-458. Link to Full Text for this item Link to SFX for this item
4. Ando, K. "The average degree of minimally contraction-critically 5-connected graphs." Journal of graph theory 75.4 (2014): 331-354. Link to Full Text for this item Link to SFX for this item
5. Kriesell, M. "A degree sum condition for the existence of a contractible edge in a $\kappa$-connected graph." Journal of combinatorial theory. Series B 82.1 (2001): 81-101. Link to Full Text for this item Link to SFX for this item
Select All Clear All

Expand list of advanced services Advanced
A service provided by the Library of the Wissenschaftspark Albert Einstein, Potsdam, Germany.
© 2005 SFX by Ex Libris Inc.