نتایج جستجو برای: spanning trees
تعداد نتایج: 132287 فیلتر نتایج به سال:
Journal:
:Mathematics in Computer Science
2009
Journal:
:Journal of Combinatorial Theory, Series B
2021
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. Our main result implies that, given any optimal colouring a sufficiently large complete K2n, there exists decomposition K2n into isomorphic spanning trees. This settles conjectures Brualdi–Hollingsworth (from 1996) and Constantine 2002) for graphs.
Journal:
:Journal of Computer and System Sciences
1978
Journal:
:IEEE Transactions on Information Forensics and Security
2012
Journal:
:Journal of Algebraic Combinatorics
2015
Journal:
:RAIRO - Theoretical Informatics and Applications
1991
Journal:
:Electronic Notes in Theoretical Computer Science
2019
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید