default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Skoda 0002
Person information
- affiliation: Simon Fraser University, Department of Mathematics, Burnaby, BC, Canada
Other persons with the same name
- Petr Skoda 0001
![[0000-0002-2732-9370]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2732-9370")
— Charles University in Prague, Faculty of Mathematics and Physics, Czech Republic - Petr Skoda 0003 — Brno University of Technology, IT4Innovations Centre of Excellence, Czech Republic
- Petr Skoda 0004 — Astronomical Institute of the Academy of Sciences, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Bojan Mohar, Petr Skoda:
Excluded minors for the Klein bottle I. Low connectivity case. J. Comb. Theory B 164: 299-320 (2024)- [j7]Bojan Mohar, Petr Skoda:
Excluded minors for the Klein bottle II. Cascades. J. Comb. Theory B 166: 80-108 (2024)
2010 – 2019
- 2017
- [j6]Bojan Mohar, Petr Skoda:
Obstructions for two-vertex alternating embeddings of graphs in surfaces. Eur. J. Comb. 59: 96-113 (2017) - 2013
- [j5]Petr Skoda:
Computability of width of submodular partition functions. Eur. J. Comb. 34(3): 660-665 (2013) - 2012
- [j4]Bojan Mohar, Petr Skoda:
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. J. Graph Algorithms Appl. 16(2): 225-241 (2012) - [j3]Daniel Král', Petr Skoda, Jan Volec:
Domination number of cubic graphs with large girth. J. Graph Theory 69(2): 131-142 (2012) - 2011
- [c1]Bojan Mohar, Petr Skoda:
On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. IWOCA 2011: 300-309 - 2010
- [j2]Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski:
An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31(5): 1316-1334 (2010)
2000 – 2009
- 2008
- [j1]Daniel Král, Petr Skoda:
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. SIAM J. Discret. Math. 22(4): 1559-1569 (2008)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
