Decompositions of complete graphs into theta graphs with fewer than ten edges

Authors

  • Blinco, Andrew

Abstract

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K v into theta graphs with fewer than ten edges are given.

Published

2003-06-09

How to Cite

Blinco, Andrew. (2003). Decompositions of complete graphs into theta graphs with fewer than ten edges. Utilitas Mathematica, 64. Retrieved from http://utilitasmathematica.com/index.php/Index/article/view/274

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.