Fork-forests in bi-colored complete bipartite graphs
From MaRDI portal
Publication:2446314
DOI10.1016/j.dam.2013.01.023zbMath1287.05039arXiv1201.2551OpenAlexW2091014664MaRDI QIDQ2446314
Marcus Krug, Georg Osang, Ignaz Rutter, Maria A. Axenovich
Publication date: 16 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.2551
Cites Work
- Unnamed Item
- Unnamed Item
- Color degree and alternating cycles in edge-colored graphs
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Cycles and paths in edge‐colored graphs with given degrees
- Long Alternating Cycles in Edge-Colored Complete Graphs
- Faster scaling algorithms for general graph matching problems
- Edge disjoint monochromatic triangles in 2-colored graphs
This page was built for publication: Fork-forests in bi-colored complete bipartite graphs