The ratio of the numbers of odd and even cycles in outerplanar graphs

DOI10.1016/j.disc.2022.113285OpenAlexW4311760389MaRDI QIDQ2685320

Naoki Matsumoto, Akihiro Higashitani

Publication date: 21 February 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.02361

zbMATH Keywords

cycleenumerationclaw-free graphouterplanar graphsubtree

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on Hamilton cycles in directed graphs
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Alternating Whitney sums and matchings in trees. II
• Monotonicity of the mean order of subtrees
• Triangle-free graphs with the maximum number of cycles
• The average order of a subtree of a tree
• Alternating Whitney sums and matchings in trees. 1
• On a general class of graph polynomials
• Estimations for the number of cycles in a graph
• Advances on the Hamiltonian problem -- a survey
• On the average number of nodes in a subtree of a tree
• On the roots of the subtree polynomial
• Cycles in 5-connected triangulations
• Bipartition polynomials, the Ising model, and domination in graphs
• The number of paths and cycles in a digraph
• Identifying certain types of parts of a graph and computing their number
• On the maximum number of cycles in a Hamiltonian graph
• Über eine Eigenschaft der ebenen Komplexe
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• A Characterization of $K_{2,4}$-Minor-Free Graphs
• On the number of hamiltonian cycles in triangulations with few separating triangles
• On the number of cycles in a graph
• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• Reducibility among Combinatorial Problems
• A Contribution to the Theory of Chromatic Polynomials
• Chromatic Polynomials

This page was built for publication: The ratio of the numbers of odd and even cycles in outerplanar graphs