Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

Toru Hasunuma

doi:10.1007/978-3-319-29516-9_22

ScienceGate Book Chapters

BOOK-CHAPTER

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

Toru Hasunuma

Year: 2016 Lecture notes in computer science Pages: 260-273 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-319-29516-9_22

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Spanning tree Trémaux tree Mathematics Minimum spanning tree Vertex (graph theory) Graph Discrete mathematics Degree (music) Line graph Physics Pathwidth

Metrics

Cited By

11.96

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

Metrics

Citation History

Topics

Related Documents

Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs

Completely Independent Spanning Trees in Line Graphs

Degree condition for completely independent spanning trees

Completely Independent Spanning Trees in Maximal Planar Graphs

Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph