Farey Series and Maximal Outerplanar Graphs

DOI10.1137/0603018zbMath0499.05025OpenAlexW2069043573MaRDI QIDQ3964591

Charles J. Colbourn

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603018

zbMATH Keywords

isomorphism problemsmaximal outerplanar graphsFarey series of irreducible fractions

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

Counting spanning trees of a type of generalized Farey graphs ⋮ Rainbow vertex-connection number on a small-world Farey graph ⋮ Enumeration of subtrees of planar two-tree networks ⋮ Farey graphs as models for complex networks ⋮ Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Combinatorial properties of Farey graphs

Cites Work

• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• An introduction to chromatic polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: Farey Series and Maximal Outerplanar Graphs