Farey Series and Maximal Outerplanar Graphs

DOI10.1137/0603018zbMATH Open0499.05025OpenAlexW2069043573MaRDI QIDQ3964591FDOQ3964591

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)

Cites Work

• An introduction to chromatic polynomials
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964591)