Photo from wikipedia
We provide a structural property of trees, which is applied to show that if a plane graph contains two edge-disjoint spanning trees, then its dual graph has the vertex-arboricity at… Click to show full abstract
We provide a structural property of trees, which is applied to show that if a plane graph contains two edge-disjoint spanning trees, then its dual graph has the vertex-arboricity at most 2. We also show that every maximal plane graph of order at least 4 contains two edge-disjoint spanning trees.
Keywords:
trees application;
property trees;
vertex arboricity;
structural property
Journal Title: Mathematical Problems in Engineering
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematical Problems in Engineering
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!