Triangle Decompositions of Planar Graphs

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...

詳細記述

書誌詳細
出版年:Discussiones Mathematicae Graph Theory
主要な著者: Mynhardt Christina M., Bommel Christopher M. van
フォーマット: 論文
言語:英語
出版事項: University of Zielona Góra 2016-08-01
主題:
オンライン・アクセス:https://doi.org/10.7151/dmgt.1882