scientific article; zbMATH DE number 1151805
From MaRDI portal
Publication:4387712
Recommendations
Cited in
(22)- Note on cycle double covers of graphs
- Cycle covering in bridgeless graphs
- Proof of the strong 2-cover conjecture for planar graphs
- On covers of graphs
- The minimum rooted-cycle cover problem
- Cycle cover property and \(\text{CPP}=\text{SCC}\) property are not equivalent
- Circuit coverings of graphs and a conjecture of Pyber
- Short cycle covers of graphs with at most 77\% vertices of degree two
- Shortest cycle covers and cycle double covers with large 2-regular subgraphs
- A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
- Circularity of planar graphs
- Approximately covering by cycles in planar graphs.
- Circuit double cover of graphs
- scientific article; zbMATH DE number 3885954 (Why is no real title available?)
- scientific article; zbMATH DE number 3937198 (Why is no real title available?)
- scientific article; zbMATH DE number 140148 (Why is no real title available?)
- Path covers of weighted graphs
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
- scientific article; zbMATH DE number 5809 (Why is no real title available?)
- \(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski
- Finding vertex-disjoint cycle cover of undirected graph using the least-squares method.
- On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs
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 Q4387712)
