Fork-forests in bi-colored complete bipartite graphs (Q2446314): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cycles and paths in edge‐colored graphs with given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint monochromatic triangles in 2-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3006476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color degree and alternating cycles in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long Alternating Cycles in Edge-Colored Complete Graphs / rank
 
Normal rank

Latest revision as of 10:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Fork-forests in bi-colored complete bipartite graphs
scientific article

    Statements

    Fork-forests in bi-colored complete bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2014
    0 references
    0 references
    bi-colored star forests
    0 references
    balanced colorings
    0 references
    OBDD
    0 references
    0 references
    0 references