scientific article; zbMATH DE number 4061286
From MaRDI portal
Publication:3795702
Recommendations
- On the Eulerian cycle decomposition conjecture and complete multipartite graphs
- Hajós' conjecture and connectivity of Eulerian graphs
- Hajós' conjecture and cycle power graphs
- A cycle decomposition conjecture for Eulerian graphs
- Vertex-minors and the Erdős-Hajnal conjecture
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
- On the Hajós number of graphs
- On partition dimension of some cycle-related graphs
- On Hadwiger conjecture for certain families of graphs with restricted number of cycles
- On the minimum number of Hamiltonian cycles in regular graphs
Cited in
(12)- Hajós' conjecture and small cycle double covers of planar graphs
- Hajós' conjecture and projective graphs
- Hajós' conjecture and connectivity of Eulerian graphs
- Long cycles, heavy cycles and cycle decompositions in digraphs
- Decomposing toroidal graphs into circuits and edges
- Parity equivalence in eulerian graphs
- scientific article; zbMATH DE number 5016710 (Why is no real title available?)
- scientific article; zbMATH DE number 3948320 (Why is no real title available?)
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
- scientific article; zbMATH DE number 63789 (Why is no real title available?)
- -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
- Cycle decompositions of pathwidth-6 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 Q3795702)
