Cycle spectra of contraction-critically 4-connected planar graphs
From MaRDI portal
Publication:2053680
DOI10.1007/S00373-021-02358-XzbMATH Open1479.05209OpenAlexW3173508218MaRDI QIDQ2053680FDOQ2053680
Authors: On-Hei S. Lo, Jens M. Schmidt 
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02358-x
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Cites Work
- Pancyclic graphs. I
- Uncontractable 4-connected graphs
- Title not available (Why is that?)
- A Theorem on Planar Graphs
- 4-connected projective planar graphs are Hamiltonian
- A theorem on paths in planar graphs
- Title not available (Why is that?)
- Choosability and edge choosability of planar graphs without five cycles
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Planar graphs without cycles of specific lengths
- Title not available (Why is that?)
- Long cycles in 4-connected planar graphs
- Cycles in 4-connected planar graphs
- On Hamilton cycles in certain planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Find subtrees of specified weight and cycles of specified length in linear time
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)
