"A note on interconnecting matchings in graphs"@en . "2245" . . "1"^^ . . "A note on interconnecting matchings in graphs"@en . "A note on interconnecting matchings in graphs" . "V \u010Dl\u00E1nku dokazujeme posta\u010Duj\u00EDc\u00ED podm\u00EDnku pro existenci p\u00E1rov\u00E1n\u00ED, kter\u00E9 spojuje v\u0161echny komponenty nesouvisl\u00E9ho faktoru dan\u00E9ho grafu G. V\u00FDsledek aplikujeme na probl\u00E9m existence 2-sledu v tuh\u00FDch grafech."@cs . . "Discrete Mathematics" . . "0012-365X" . . . "interconnecting matching; toughness; matroid intersection; 2-walk"@en . "P(1M0545), Z(MSM4977751301)" . . . . "RIV/49777513:23520/06:00000515" . "0" . . "Pozn\u00E1mka o propojuj\u00EDc\u00EDch p\u00E1rov\u00E1n\u00EDch"@cs . "6"^^ . . "[E3EEBA03ECE1]" . . "RIV/49777513:23520/06:00000515!RIV07-MSM-23520___" . "We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs."@en . . . . . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . "We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs." . . "463704" . . "23520" . "Pozn\u00E1mka o propojuj\u00EDc\u00EDch p\u00E1rov\u00E1n\u00EDch"@cs . "A note on interconnecting matchings in graphs" . "Kaiser, Tom\u00E1\u0161" . "1"^^ .