Cycles in the complement of a tree or other graph

DOI10.1016/S0012-365X(85)80003-0zbMath0569.05036OpenAlexW2019827490MaRDI QIDQ1061138

F. C. Holroyd, W. J. G. Wingate

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(85)80003-0

zbMATH Keywords

computational complexitycyclestreesforestcomplement of a graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Paths and cycles (05C38)

Related Items (2)

The maximum number of cycles in the complement of a tree ⋮ Triangle-free graphs with the maximum number of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles in the complement of a tree
• Graphs, quasisymmetry and permutations with restricted positions
• Pancyclic graphs. I
• Identifying certain types of parts of a graph and computing their number
• Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach

This page was built for publication: Cycles in the complement of a tree or other graph