Nadzieja Hodur

activity

20242026

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

On 3-colorability of (claw, diamond)-free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

The $3$ -colorability problem is a well-known NP-complete problem and it remains NP-complete for $(c l a w, d iam o n d, K_{4})$ -free graphs. Recently, $3$ -colorability has been also conside…

math.CO2025

On $k$ -colorability of $(b u l l, H)$ -free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

The $3$ -colorability problem is a well-known NP-complete problem and it remains NP-complete for $b u l l$ -free graphs, where a $b u l l$ is the graph consisting of a $K_{3}$ with two penda…

math.CO2024

On 3-colourability of $(b u l l, H)$ -free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

The $3$ -colourability problem is a well-known NP-complete problem and it remains NP-complete for $b u l l$ -free graphs, where $b u l l$ is the graph consisting of $K_{3}$ with two pendant…

On 3-colorability of (claw, diamond)-free graphs

On k-colorability of (bull,H)-free graphs

On 3-colourability of (bull,H)-free graphs

On $k$ -colorability of $(b u l l, H)$ -free graphs

On 3-colourability of $(b u l l, H)$ -free graphs