The cycle's structure of embedded graphs in surfaces
From MaRDI portal
Publication:277096
DOI10.1007/s10255-015-0530-0zbMath1338.05055OpenAlexW2266639384MaRDI QIDQ277096
Publication date: 4 May 2016
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-015-0530-0
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Uses Software
Cites Work
- Embeddings of graphs with no short noncontractible cycles
- The complexity of determining a shortest cycle of even length
- Five-coloring maps on surfaces
- Generating cycle spaces for graphs on surfaces with small genera
- Finding shortest contractible and shortest separating cycles in embedded graphs
- An algorithm for counting short cycles in bipartite graphs
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- On connectivities of tree graphs
- On the Tree Graph of a Matroid
- Theory of Matroids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item