Cycle spectra of contraction-critically 4-connected planar graphs
From MaRDI portal
Publication:2053680
Recommendations
Cites work
- scientific article; zbMATH DE number 5902083 (Why is no real title available?)
- scientific article; zbMATH DE number 3506739 (Why is no real title available?)
- scientific article; zbMATH DE number 3577228 (Why is no real title available?)
- scientific article; zbMATH DE number 3600073 (Why is no real title available?)
- scientific article; zbMATH DE number 3339160 (Why is no real title available?)
- 4-connected projective planar graphs are Hamiltonian
- A Theorem on Planar Graphs
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- A theorem on paths in planar graphs
- Choosability and edge choosability of planar graphs without five cycles
- Cycles in 4-connected planar graphs
- Find subtrees of specified weight and cycles of specified length in linear time
- Long cycles in 4-connected planar graphs
- On Hamilton cycles in certain planar graphs
- Pancyclic graphs. I
- Planar graphs without cycles of specific lengths
- Uncontractable 4-connected graphs
Cited in
(2)
This page was built for publication: Cycle spectra of contraction-critically 4-connected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053680)