default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Rolek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Martin Rolek, Paul Scemama:
Planar graphs with no incident triangles and no 4- or 5-cycles are (7:2)-colorable. Australas. J Comb. 91: 32-40 (2025)- 2023
- [j14]Runrun Liu, Martin Rolek, Gexin Yu
:
Optimal connectivity for fat-triangle linkages. Discret. Math. 346(5): 113319 (2023) - [j13]Martin Rolek, Zi-Xia Song, Robin Thomas:
Properties of 8-contraction-critical graphs with no K7 minor. Eur. J. Comb. 110: 103711 (2023) - 2021
- [j12]Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
An improved linear connectivity bound for tournaments to be highly linked. Eur. J. Comb. 98: 103390 (2021) - [j11]Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu:
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35(1): 431-446 (2021) - [j10]Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
Sufficient Conditions for 2-Dimensional Global Rigidity. SIAM J. Discret. Math. 35(4): 2520-2534 (2021) - 2020
- [j9]Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu:
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283: 626-630 (2020) - [j8]Martin Rolek:
Graphs with no K 9 = minor are 10-colorable. J. Graph Theory 93(4): 560-565 (2020) - [j7]Martin Rolek:
The extremal function for K 9 = minors. J. Graph Theory 94(2): 206-223 (2020)
2010 – 2019
- 2019
- [j6]Runrun Liu, Martin Rolek, Gexin Yu:
Minimum degree condition for a graph to be knitted. Discret. Math. 342(11): 3225-3228 (2019) - [j5]Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu:
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. Graphs Comb. 35(3): 695-705 (2019) - 2018
- [j4]Martin Rolek, Zi-Xia Song:
Saturation numbers for Ramsey-minimal graphs. Discret. Math. 341(12): 3310-3320 (2018) - [j3]Martin Rolek, Zi-Xia Song:
Clique minors in double-critical graphs. J. Graph Theory 88(2): 347-355 (2018) - 2017
- [j2]Martin Rolek, Zi-Xia Song:
Double-critical graph conjecture for claw-free graphs. Discret. Math. 340(7): 1633-1638 (2017) - [j1]Martin Rolek, Zi-Xia Song:
Coloring graphs with forbidden minors. J. Comb. Theory B 127: 14-31 (2017)
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 2025-03-27 01:05 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:
