Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Triangle Decompositions of Planar Graphs

Christina M. MynhardtChristopher M. van Bommel — 2016

Discussiones Mathematicae Graph Theory

A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e of G, the sum of the weights of the triangles that contain e equals 1. We present a necessary and sufficient condition for a planar multigraph to be triangle decomposable. We also show that if a simple planar graph is rationally triangle decomposable, then it...

Page 1

Download Results (CSV)