Maximum properly colored trees in edge-colored graphs
From MaRDI portal
Publication:2168717
DOI10.1007/s10878-021-00824-zzbMath1498.90240OpenAlexW3206039481MaRDI QIDQ2168717
Hao Li, Jie Hu, Shun-ichi Maezawa
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00824-z
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Spanning \(k\)-trees of bipartite graphs
- Rainbow matchings in properly edge colored graphs
- Properly colored paths and cycles
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Color degree and alternating cycles in edge-colored graphs
- Alternating Hamiltonian cycles
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Rainbow Hamiltonian cycles in strongly edge-colored graphs
- Properly colored spanning trees in edge-colored graphs
- Maximum colored trees in edge-colored graphs
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Note on Hamilton Circuits
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Long properly coloured cycles in edge‐coloured graphs
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- A Dirac Type Condition for Properly Coloured Paths and Cycles
- Some Theorems on Abstract Graphs
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
