scientific article; zbMATH DE number 3948320
From MaRDI portal
Publication:3718751
zbMATH Open0591.05050MaRDI QIDQ3718751FDOQ3718751
Publication date: 1988
Title of this publication is not available (Why is that?)
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (21)
- Hajós' conjecture and connectivity of Eulerian graphs
- Gallai's conjecture for disconnected graphs
- Gallai's path decomposition conjecture for graphs of small maximum degree
- Path partitioning planar graphs of girth 4 without adjacent short cycles
- Decomposing toroidal graphs into circuits and edges
- Gallai's path decomposition conjecture for triangle-free planar graphs
- Path decompositions of triangle-free graphs
- Decompositions of 6-regular bipartite graphs into paths of length six
- On path decompositions of \(2k\)-regular graphs
- On Gallai's conjecture for graphs with maximum degree 6
- Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3
- Small oriented cycle double cover of graphs
- The problem of path decomposition for graphs with treewidth at most 4
- Small cycle double covers of 4-connected planar graphs
- Hajós' conjecture and small cycle double covers of planar graphs
- Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
- Gallai's conjecture for 3-degenerated graphs
- Gallai's conjecture on path decompositions
- Towards Gallai's path decomposition conjecture
- On computing the path number of a graph
- On path decompositions of \(2 k\)-regular graphs
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718751)
