izvor podataka: crosbi
✓
Factor-critical graphs with the minimum number of near-perfect matchings (CROSBI ID 220153)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Došlić, Tomislav ; Rautenbach, Dieter
Factor-critical graphs with the minimum number of near-perfect matchings // Discrete mathematics, 338 (2015), 12; 2318-2319. doi: 10.1016/j.disc.2015.04.032
Podaci o odgovornosti
Došlić, Tomislav ; Rautenbach, Dieter
engleski
Factor-critical graphs with the minimum number of near-perfect matchings
We show that a factor-critical graph of order n has exactly n near-perfect matchings if and only if it is a connected graph whose blocks are all odd cycles. This characterizes the factor-critical graphs with the minimum number of near-perfect matchings.
Matching; Factor-critical; Near-perfect matching
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
Povezanost rada
Povezane osobe
Povezane ustanove
Povezani projekti