scientific article; zbMATH DE number 3490998
From MaRDI portal
Publication:4073393
Cited in
(18)- The k-conversion number of regular graphs
- Finding more perfect matchings in leapfrog fullerenes
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
- Hamiltonian cycles in cubic Cayley graphs: The \(\langle 2,4k,3\rangle \) case
- Hamiltonicity of cubic planar graphs with bounded face sizes
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- Some remarks on Jaeger's dual-hamiltonian conjecture
- At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
- Upper-embeddable graphs and related topics
- Hamiltonicity in vertex envelopes of plane cubic graphs
- Upper embeddability and connectivity of graphs
- Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
- Independent sets in triangle-free cubic planar graphs
- Induced forests in cubic graphs
- On Certain Graph Theory Applications
- A tight lower bound on the maximum genus of a simplicial graph
- Arbres avec un nombre maximum de sommets pendants
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 Q4073393)
