scientific article; zbMATH DE number 3948320
From MaRDI portal
Publication:3718751
Recommendations
Cited in
(23)- Small cycle double covers of 4-connected planar graphs
- Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3
- Gallai's path decomposition conjecture for graphs of small maximum degree
- Small oriented cycle double cover of graphs
- Hajós' conjecture and connectivity of Eulerian graphs
- The problem of path decomposition for graphs with treewidth at most 4
- Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
- Decomposing toroidal graphs into circuits and edges
- On path decompositions of \(2 k\)-regular graphs
- Paths, chains, and antipaths
- Path partitioning planar graphs of girth 4 without adjacent short cycles
- Hajós' conjecture and small cycle double covers of planar graphs
- Decompositions of 6-regular bipartite graphs into paths of length six
- Gallai's conjecture on path decompositions
- On computing the path number of a graph
- Gallai's conjecture for 3-degenerated graphs
- Towards Gallai's path decomposition conjecture
- Gallai's path decomposition conjecture for triangle-free planar graphs
- On path decompositions of \(2k\)-regular graphs
- On Gallai's conjecture for graphs with maximum degree 6
- Cycle packing
- Path decompositions of triangle-free graphs
- Gallai's conjecture for disconnected graphs
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)
