Publication:5611646

zbMath0209.55404MaRDI QIDQ5611646

Frank Harary, Bennet Manvel

Publication date: 1971

Full work available at URL: https://eudml.org/doc/29956

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, The birth of geometry in exponential random graphs, Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Triangle-free graphs with the maximum number of cycles, On a novel connectivity index, Cycles in the complement of a tree or other graph, The problem of isolating and counting, 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, Estimations for the number of cycles in a graph, Combinatorial quantum gravity: geometry from random bits, Enumerating simple paths from connected induced subgraphs, A spectral condition for the existence of a pentagon in non-bipartite graphs, A general purpose algorithm for counting simple cycles and simple paths of any length, Identifying certain types of parts of a graph and computing their number, Heuristics for the maximum outerplanar subgraph problem, The ratio of the numbers of odd and even cycles in outerplanar graphs, Self-assembly of geometric space from random graphs

Cites Work

• Enumeration of paths in digraphs
• The number of paths and cycles in a digraph
• On the determination of redundancies in sociometric chains
• Unnamed Item
• Unnamed Item