Maximum colored trees in edge-colored graphs (Q2311375): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127678239, #quickstatements; #temporary_batch_1722291251637
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2018.02.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952726132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and trails in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in bipartite decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles in edge-partitioned graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating paths in edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating cycles in edge-coloured graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127678239 / rank
 
Normal rank

Latest revision as of 12:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Maximum colored trees in edge-colored graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references