Results

eNauka >  Rezultati >  Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
Naziv: Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
Autori: Aboulker, Pierre; Radovanović, Marko  ; Trotignon, Nicolas; Vušković, Kristina  
Godina: 2012
Publikacija: SIAM Journal on Discrete Mathematics
ISSN: 0895-4801 SIAM Journal on Discrete Mathematics / Society for Industrial and Applied Mathematics Pretraži identifikator
Tip rezultata: Naučni članak
Kolacija: vol. 26 br. 4 str. 1510-1531
DOI: 10.1137/11084933x
WoS-ID: 000312700400002
Scopus-ID: 2-s2.0-84871562708
URI: https://enauka.gov.rs/handle/123456789/373771
Izvor metapodataka: Migrirano iz RIS podataka
M-kategorija: 
22M22 - Rad u istaknutom međ. časopisu

13
SCOPUSTM
11
OpenCitations
11
WEB OF SCIENCETM
Altmetric
Dimensions

Find the DOI

Unpaywall

Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.