Maximum colored trees in edge-colored graphs
From MaRDI portal
Publication:2311375
DOI10.1016/j.ejc.2018.02.027zbMath1415.05049OpenAlexW2952726132WikidataQ127678239 ScholiaQ127678239MaRDI QIDQ2311375
Publication date: 10 July 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2018.02.027
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Maximum properly colored trees in edge-colored graphs ⋮ Colored constrained spanning tree on directed graphs ⋮ Parallel connectivity in edge-colored complete graphs: complexity results ⋮ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs ⋮ Properly colored spanning trees in edge-colored graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Alternating cycles in edge-partitioned graphs
- Multicolored forests in bipartite decompositions of graphs
- A note on alternating cycles in edge-coloured graphs
- Alternating paths in edge-colored complete graphs
- Paths and trails in edge-colored graphs
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Multicolored trees in complete graphs
- Multicolored forests in complete bipartite graphs
