Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис: http://hdl.handle.net/20.500.12188/5247
DC FieldValueLanguage
dc.contributor.authorPetrushevski, Mirkoen_US
dc.contributor.authorŠkrekovski, Risteen_US
dc.date.accessioned2019-11-07T11:48:25Z-
dc.date.available2019-11-07T11:48:25Z-
dc.date.issued2019-11-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/5247-
dc.language.isoen_USen_US
dc.publisherWileyen_US
dc.relation.ispartofJournal of Graph Theoryen_US
dc.titleCoverability of graph by three odd subgraphsen_US
dc.typeJournal Articleen_US
dc.identifier.doi10.1002/jgt.22455-
dc.identifier.urlhttps://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fjgt.22455-
dc.identifier.urlhttps://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22455-
dc.identifier.urlhttps://onlinelibrary.wiley.com/doi/full-xml/10.1002/jgt.22455-
dc.identifier.urlhttps://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22455-
dc.identifier.volume92-
dc.identifier.issue3-
dc.identifier.fpage304-
dc.identifier.lpage321-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptFaculty of Mechanical Engineering-
Appears in Collections:Faculty of Mechanical Engineering: Journal Articles
Прикажи едноставен запис

Page view(s)

66
checked on 19.7.2025

Google ScholarTM

Проверете

Altmetric


Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.