ExLibris header image
SFX Logo
Title: Optimal packings of edge-disjoint odd cycles
Source:

Discrete Mathematics [0012-365X] Berge, Claude yr:2000


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. Raymond, J. "Recent techniques and results on the Erdős–Pósa property." Discrete applied mathematics 231 (2017): 25-43. Link to SFX for this item
2. Schrijver, A. "Paths in Graphs and Curves on Surfaces." 1994. Link to SFX for this item
3. Kakimura, N. "Coloring immersion-free graphs." Journal of combinatorial theory. 121: 284-307. Link to SFX for this item
4. Kakimura, N. "Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs." SIAM journal on discrete mathematics 31.2: 766-782. 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.