Martin Rolek

According to our database, Martin Rolek authored at least 15 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Planar graphs with no incident triangles and no 4- or 5-cycles are (7:2)-colorable.

Martin Rolek, Paul Scemama

Australas. J Comb., February, 2025

2023

Properties of 8-contraction-critical graphs with no K7 minor.

Martin Rolek, Zi-Xia Song, Robin Thomas

Eur. J. Comb., May, 2023

Optimal connectivity for fat-triangle linkages.

Runrun Liu, Martin Rolek, Gexin Yu

Discret. Math., May, 2023

2021

Connectivity for Kite-Linked Graphs.

Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu

SIAM J. Discret. Math., 2021

Sufficient Conditions for 2-Dimensional Global Rigidity.

Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu

SIAM J. Discret. Math., 2021

An improved linear connectivity bound for tournaments to be highly linked.

Wei Meng, Martin Rolek, Yue Wang, Gexin Yu

Eur. J. Comb., 2021

2020

The extremal function for K 9 = minors.

Martin Rolek

J. Graph Theory, 2020

Graphs with no K 9 = minor are 10-colorable.

Martin Rolek

J. Graph Theory, 2020

Packing (1, 1, 2, 2)-coloring of some subcubic graphs.

Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu

Discret. Appl. Math., 2020

2019

DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}.

Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu

Graphs Comb., 2019

Minimum degree condition for a graph to be knitted.

Runrun Liu, Martin Rolek, Gexin Yu

Discret. Math., 2019

2018

Clique minors in double-critical graphs.

Martin Rolek, Zi-Xia Song

J. Graph Theory, 2018

Saturation numbers for Ramsey-minimal graphs.

Martin Rolek, Zi-Xia Song

Discret. Math., 2018

2017

Coloring graphs with forbidden minors.

Martin Rolek, Zi-Xia Song

J. Comb. Theory B, 2017

Double-critical graph conjecture for claw-free graphs.

Martin Rolek, Zi-Xia Song

Discret. Math., 2017