Triangle Decompositions of Planar Graphs

Discussiones Mathematicae Graph Theory

Bommel Christopher M. van¹  Mynhardt Christina M.² 

[1] Department of Mathematics and Statistics University of Victoria P.O. Box 1700 STN CSC Victoria, BC, Canada V8W 2Y2, PhD student, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada;Department of Mathematics and Statistics University of Victoria P.O. Box 1700 STN CSC Victoria, BC, Canada V8W 2Y2;

关键词: planar graphs;    triangle decompositions;    rational triangle decompositions;   

DOI  :  10.7151/dmgt.1882

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown