A direct method for calculating cell cycles of a block map of a simple planar graph

DOI10.17223/20710410/58/7zbMath1506.05055OpenAlexW4318830949MaRDI QIDQ5871440

B. N. Ivanov

Publication date: 19 January 2023

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm786

zbMATH Keywords

planar graphgraph block cyclesplanar graph cycles

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approximation algorithms for minimum cycle bases of graphs
• On Algorithms for Enumerating All Circuits of a Graph
• Enumeration of the Elementary Circuits of a Directed Graph
• Finding All the Elementary Circuits of a Directed Graph
• A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
• An algorithm for finding a fundamental set of cycles of a graph
• A Cycle Generation Algorithm for Finite Undirected Linear Graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A direct method for calculating cell cycles of a block map of a simple planar graph