Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees

SIAM Journal on Discrete Mathematics ◽

10.1137/19m1299876 ◽

2020 ◽

Vol 34 (4) ◽

pp. 2346-2362

Author(s):

Linyuan Lu ◽

Zhiyu Wang

Keyword(s):

Spanning Trees ◽

Ramsey Number ◽

Download Full-text

Constructing edge-disjoint spanning trees in locally twisted cubes

Theoretical Computer Science ◽

10.1016/j.tcs.2008.12.025 ◽

2009 ◽

Vol 410 (8-10) ◽

pp. 926-932 ◽

Author(s):

Sun-Yuan Hsieh ◽

Chang-Jen Tu

Keyword(s):

Spanning Trees ◽

Edge Disjoint ◽

Locally Twisted Cubes ◽

Download Full-text

Nowhere-zero 3-flow and Z3-connectedness in graphs with four edge-disjoint spanning trees

Journal of Graph Theory ◽

10.1002/jgt.22231 ◽

2017 ◽

Vol 88 (4) ◽

pp. 577-591 ◽

Author(s):

Miaomiao Han ◽

Hong-Jian Lai ◽

Jiaao Li

Keyword(s):

Spanning Trees ◽

Download Full-text

Good orientations of unions of edge‐disjoint spanning trees

Journal of Graph Theory ◽

10.1002/jgt.22633 ◽

2020 ◽

Author(s):

Jørgen Bang‐Jensen ◽

Stéphane Bessy ◽

Jing Huang ◽

Matthias Kriesell

Keyword(s):

Spanning Trees ◽

Download Full-text

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs

Journal of Graph Theory ◽

10.1002/jgt.21857 ◽

2015 ◽

Vol 81 (1) ◽

pp. 16-29 ◽

Author(s):

Xiaofeng Gu ◽

Hong-Jian Lai ◽

Ping Li ◽

Senmei Yao

Keyword(s):

Spanning Trees ◽

Edge Connectivity ◽

Download Full-text

Edge-disjoint rainbow spanning trees in complete graphs

European Journal of Combinatorics ◽

10.1016/j.ejc.2016.04.003 ◽

2016 ◽

Vol 57 ◽

pp. 71-84 ◽

Author(s):

James M. Carraher ◽

Stephen G. Hartke ◽

Paul Horn

Keyword(s):

Spanning Trees ◽

Complete Graphs ◽

Download Full-text

Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees

Graphs and Combinatorics ◽

10.1007/s00373-020-02250-0 ◽

2020 ◽

Author(s):

Yuxing Jia ◽

Mei Lu ◽

Yi Zhang

Keyword(s):

Spanning Trees ◽

Bipartite Graphs ◽

Edge Disjoint ◽

Complete Bipartite Graphs

Download Full-text

Edge-disjoint spanning trees in the line graph of hypercubes

10.1109/asap52443.2021.00017 ◽

2021 ◽

Author(s):

Yu Qian ◽

Baolei Cheng ◽

Jianxi Fan ◽

Yifeng Wang ◽

Ruofan Jiang

Keyword(s):

Spanning Trees ◽

Download Full-text

Edge-disjoint spanning trees and the number of maximum state circles of a graph

Journal of Combinatorial Optimization ◽

10.1007/s10878-018-0249-y ◽

2018 ◽

Vol 35 (4) ◽

pp. 997-1008 ◽

Author(s):

Xiaoli Ma ◽

Baoyindureng Wu ◽

Xian’an Jin

Keyword(s):

Spanning Trees ◽

Download Full-text

Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

Journal of Parallel and Distributed Computing ◽

10.1006/jpdc.2001.1751 ◽

2001 ◽

Vol 61 (9) ◽

pp. 1278-1306 ◽

Author(s):

Honge Wang ◽

Douglas M. Blough

Keyword(s):

Spanning Trees ◽

Edge Disjoint ◽

Download Full-text

Anti-Ramsey Numbers in Complete k-Partite Graphs

Mathematical Problems in Engineering ◽

10.1155/2020/5136104 ◽

2020 ◽

Vol 2020 ◽

pp. 1-5

Author(s):

Jili Ding ◽

Hong Bian ◽

Haizheng Yu

Keyword(s):

Spanning Trees ◽

Edge Coloring ◽

Perfect Matchings ◽

Ramsey Number ◽

Hamilton Cycles ◽

Ramsey Numbers ◽

The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H. In this paper, we discuss the anti-Ramsey numbers ARKp1,p2,…,pk,Tn, ARKp1,p2,…,pk,ℳ, and ARKp1,p2,…,pk,C of Kp1,p2,…,pk, where Tn,ℳ, and C denote the family of all spanning trees, the family of all perfect matchings, and the family of all Hamilton cycles in Kp1,p2,…,pk, respectively.

Download Full-text