Maximum properly colored trees in edge-colored graphs

Jie Hu (), Hao Li () and Shun-ichi Maezawa ()
Additional contact information
Jie Hu: Laboratoire Interdisciplinaire des Sciences du Numérique, CNRS - Université Paris-Saclay
Hao Li: Laboratoire Interdisciplinaire des Sciences du Numérique, CNRS - Université Paris-Saclay
Shun-ichi Maezawa: The University of Electro-Communications

Journal of Combinatorial Optimization, 2022, vol. 44, issue 1, No 8, 154-171

Abstract: Abstract An edge-colored graph G is a graph with an edge coloring. We say G is properly colored if any two adjacent edges of G have distinct colors, and G is rainbow if any two edges of G have distinct colors. For a vertex $$v \in V(G)$$ v ∈ V ( G ) , the color degree $$d_G^{col}(v)$$ d G col ( v ) of v is the number of distinct colors appearing on edges incident with v. The minimum color degree $$\delta ^{col}(G)$$ δ col ( G ) of G is the minimum $$d_G^{col}(v)$$ d G col ( v ) over all vertices $$v \in V(G)$$ v ∈ V ( G ) . In this paper, we study the relation between the order of maximum properly colored tree in G and the minimum color degree $$\delta ^{col}(G)$$ δ col ( G ) of G. We obtain that for an edge-colored connected graph G, the order of maximum properly colored tree is at least $$\min \{|G|, 2\delta ^{col}(G)\}$$ min { | G | , 2 δ col ( G ) } , which generalizes the result of Cheng et al. [Properly colored spanning trees in edge-colored graphs, Discrete Math., 343 (1), 2020]. Moreover, the lower bound $$2\delta ^{col}(G)$$ 2 δ col ( G ) in our result is sharp and we characterize all extremal graphs G with the maximum properly colored tree of order $$2\delta ^{col}(G) \ne |G|$$ 2 δ col ( G ) ≠ | G | .

Keywords: Edge-colored graph; Properly colored tree; Color degree (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00824-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00824-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00824-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().