Kamil Popielarz

According to our database, Kamil Popielarz authored at least 9 papers between 2017 and 2021.

Collaborative distances:

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

2021

Subdivisions of digraphs in tournaments.

António Girão, Kamil Popielarz, Richard Snyder

J. Comb. Theory B, 2021

(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked.

António Girão, Kamil Popielarz, Richard Snyder

Comb., 2021

2020

Rainbow saturation of graphs.

António Girão, David Lewis, Kamil Popielarz

J. Graph Theory, 2020

2019

Partite Saturation of Complete Graphs.

António Girão, Teeradej Kittipassorn, Kamil Popielarz

SIAM J. Discret. Math., 2019

On the Maximum Diameter of Path-Pairable Graphs.

António Girão, Kamil Popielarz, Gábor Mészáros, Richard Snyder

Graphs Comb., 2019

On the Maximum Degree of Path-Pairable Planar Graphs.

António Girão, Gábor Mészáros, Kamil Popielarz, Richard Snyder

Electron. J. Comb., 2019

2018

Large Induced Subgraphs with k Vertices of Almost Maximum Degree.

António Girão, Kamil Popielarz

SIAM J. Discret. Math., 2018

A stability theorem for maximal <i>K</i>_<i>r</i>+1-free graphs.

Kamil Popielarz, Julian Sahasrabudhe, Richard Snyder

J. Comb. Theory B, 2018

2017

Generalized Majority Colourings of Digraphs.

António Girão, Teeradej Kittipassorn, Kamil Popielarz

Comb. Probab. Comput., 2017