default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGasper Fijavz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j22]Md. Jawaherul Alam
, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Threshold-coloring and unit-cube contact representation of planar graphs. Discret. Appl. Math. 216: 2-14 (2017)- 2016
- [j21]Gasper Fijavz, Atsuhiro Nakamoto:
Odd complete minors in even embeddings on surfaces. Discret. Math. 339(1): 165-178 (2016) - 2015
- [j20]Gasper Fijavz:
Bounded face-width forces K7-minors in orientable surfaces. Electron. Notes Discret. Math. 49: 399-406 (2015) - 2013
- [c1]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. WG 2013: 26-37 - [i1]Md. Jawaherul Alam, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold Coloring and Unit-Cube Contact Representation of Graphs. CoRR abs/1302.6183 (2013) - 2011
- [j19]Gasper Fijavz, Seiya Negami, Terukazu Sano:
3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars Math. Contemp. 4(1): 165-175 (2011) - [j18]Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood:
On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. 32(8): 1244-1252 (2011) - 2010
- [j17]Gasper Fijavz, David R. Wood:
Graph Minors and Minimum Degree. Electron. J. Comb. 17(1) (2010) - [j16]Gasper Fijavz, Bojan Mohar:
Rigidity and Separation Indices of Graphs in Surfaces. Graphs Comb. 26(4): 491-498 (2010)
2000 – 2009
- 2008
- [j15]Drago Bokal, Gasper Fijavz, David R. Wood:
The Minor Crossing Number of Graphs with an Excluded Minor. Electron. J. Comb. 15(1) (2008) - [j14]Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discret. Math. 308(24): 6064-6077 (2008) - [j13]Gasper Fijavz, David R. Wood:
Minimum Degree and Graph Minors. Electron. Notes Discret. Math. 31: 79-83 (2008) - [j12]María Jose Chávez, Gasper Fijavz, Alberto Márquez, Atsuhiro Nakamoto, Esperanza Suárez:
Geometric Realization of Möbius Triangulations. SIAM J. Discret. Math. 23(1): 221-232 (2008) - 2007
- [j11]Gasper Fijavz:
Hadwiger's conjecture for circular colorings of edge-weighted graphs. Discret. Math. 307(3-5): 402-408 (2007) - [j10]Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electron. Notes Discret. Math. 28: 55-59 (2007) - [j9]Gasper Fijavz:
Contractions of 6-connected toroidal graphs. J. Comb. Theory B 97(4): 553-570 (2007) - 2006
- [j8]Gasper Fijavz:
Coloring Weighted Series-Parallel Graphs. Informatica (Slovenia) 30(3): 321-324 (2006) - [j7]Drago Bokal, Gasper Fijavz, Bojan Mohar:
The Minor Crossing Number. SIAM J. Discret. Math. 20(2): 344-356 (2006) - 2004
- [j6]Gasper Fijavz, Bojan Mohar:
Rigidity and separation indices of Paley graphs. Discret. Math. 289(1-3): 157-161 (2004) - [j5]Gasper Fijavz:
Minor-minimal 6-regular graphs in the Klein bottle. Eur. J. Comb. 25(6): 893-898 (2004) - [j4]Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar:
The circular chromatic number of a digraph. J. Graph Theory 46(3): 227-240 (2004) - 2003
- [j3]Gasper Fijavz, Bojan Mohar:
K6-Minors in Projective Planar Graphs. Comb. 23(3): 453-465 (2003) - 2002
- [j2]Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski:
Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. 23(4): 377-388 (2002) - 2000
- [j1]Gasper Fijavz:
K6 and icosahedron minors in 5-connected projective planar graphs. Electron. Notes Discret. Math. 5: 116-119 (2000)
Coauthor Index
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-06-10 21:28 CEST 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:
