scientific article; zbMATH DE number 2230233
From MaRDI portal
Publication:5708525
zbMath1075.05580MaRDI QIDQ5708525
Natalia Oksimets, Armen S. Asratian
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- On the complexity of partitioning graphs into connected subgraphs
- Eulerian graphs and related topics. Part 1, Volume 1
- Eulerian graphs and related topics. Part 1, Volume 2
- Triangle-free Eulerian tours in graphs with maximum degree at most 4
- Trois Types De Décompositions D'un Graphe En Chaînes
- On partitioning the edges of graphs into connected subgraphs
- P4-decompositions of regular graphs
- Perfect path double covers of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: