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

DOI10.1016/J.DISC.2020.112042MaRDI QIDQ2198384zbMATH OpenOpenAlexFDO

Authors Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima, Mikio Kano

Publication date 10 September 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2020.112042

zbMATH Keywords

rainbowedge-colored graphspanning treeproperly colored

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Properly colored spanning trees in edge-colored graphs
• Maximum properly colored trees in edge-colored graphs
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs

Cites work

• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Color degree sum conditions for rainbow triangles in edge-colored graphs
• Multicolored trees in complete graphs
• Note on Hamilton Circuits
• Properly colored spanning trees in edge-colored graphs
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
• Some Theorems on Abstract Graphs

Cited in

(5)

• Colored constrained spanning tree on directed graphs
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs
• Properly colored spanning trees in edge-colored graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph

This page was built for publication: Color degree sum conditions for properly colored spanning trees in edge-colored graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198384)