scientific article; zbMATH DE number 3334023
From MaRDI portal
Publication:5611646
zbMath0209.55404MaRDI QIDQ5611646
Publication date: 1971
Full work available at URL: https://eudml.org/doc/29956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items (26)
An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms ⋮ Estimations for the number of cycles in a graph ⋮ A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ Number of cycles of small length in a graph ⋮ The problem of isolating and counting ⋮ Triangle-free graphs with the maximum number of cycles ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Topological network entanglement as order parameter for the emergence of geometry ⋮ Combinatorial quantum gravity: geometry from random bits ⋮ Enumerating simple paths from connected induced subgraphs ⋮ Distribution of points of odd degree of certain triangulations in the plane ⋮ n-tuple colorings and associated graphs ⋮ Gedanken zur Vier-Farben-Vermutung ⋮ Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen ⋮ Cycles in the complement of a tree ⋮ A spectral condition for the existence of a pentagon in non-bipartite graphs ⋮ Self-assembly of geometric space from random graphs ⋮ On a novel connectivity index ⋮ Identifying certain types of parts of a graph and computing their number ⋮ Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Heuristics for the maximum outerplanar subgraph problem ⋮ Cycles in the complement of a tree or other graph ⋮ The birth of geometry in exponential random graphs
Cites Work
This page was built for publication:
