Pregled bibliografske jedinice broj: 771511
Factor-critical graphs with the minimum number of near-perfect matchings
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 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 771511 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Factor-critical graphs with the minimum number of near-perfect matchings
Autori
Došlić, Tomislav ; Rautenbach, Dieter
Izvornik
Discrete mathematics (0012-365X) 338
(2015), 12;
2318-2319
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Matching; Factor-critical; Near-perfect matching
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
037-0000000-2779 - Diskretna matematika i primjene (Svrtan, Dragutin, MZOS ) ( CroRIS)
177-0000000-0884 - Diskretni matematički modeli u kemiji (Vukičević, Damir, MZOS ) ( CroRIS)
Ustanove:
Građevinski fakultet, Zagreb
Profili:
Tomislav Došlić
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
