Properly colored spanning trees in edge-colored graphs

Yangyang Cheng; Mikio Kanō; Guanghui Wang

doi:10.1016/j.disc.2019.111629

ScienceGate Book Chapters

JOURNAL ARTICLE

Properly colored spanning trees in edge-colored graphs

Yangyang Cheng Mikio Kanō Guanghui Wang

Year: 2019 Journal: Discrete Mathematics Vol: 343 (1)Pages: 111629-111629 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2019.111629

Get Full-Text PDF Get Analytical Report

Keywords:

Colored Combinatorics Mathematics Rainbow Vertex (graph theory) Spanning tree Graph factorization Graph Vertex connectivity Discrete mathematics Graph power Line graph Physics

Metrics

Cited By

2.00

FWCI (Field Weighted Citation Impact)

Refs

0.86

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Properly colored spanning trees in edge-colored graphs

Metrics

Citation History

Topics

Related Documents

Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs

Maximum properly colored trees in edge-colored graphs

Color degree sum conditions for properly colored spanning trees in edge-colored graphs

Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees

Properly colored cycles in edge-colored graphs