Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges
Combinatorics
2021-08-23 v2
Abstract
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly triangle divisible graph that is also triangle decomposable. We explore several classes of planar graphs as well as a class of toroidal graphs.
Keywords
Cite
@article{arxiv.2108.07890,
title = {Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges},
author = {C. M. Mynhardt and A. K. Wright},
journal= {arXiv preprint arXiv:2108.07890},
year = {2021}
}