Irena Penev

Orcid: 0000-0002-3432-8421

Affiliations:
  • Charles University, Prague, Czech Republic


According to our database1, Irena Penev authored at least 19 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Coloring (4<i>K</i><sub>1</sub>,<i>C</i><sub>4</sub>,<i>C</i><sub>6</sub>)-free graphs.
Discret. Math., November, 2023

Bisimplicial separators.
CoRR, 2023

2022
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs.
J. Graph Theory, 2022

2021
Coloring rings.
J. Graph Theory, 2021

2020
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness.
J. Graph Theory, 2020

On the clique-width of (4K1, C4, C5, C7)-free graphs.
Discret. Appl. Math., 2020

2018
Stable Sets in {ISK4, wheel}-Free Graphs.
Algorithmica, 2018

2017
Amalgams and χ-Boundedness.
J. Graph Theory, 2017

Graphs with No Induced Five-Vertex Path or Antipath.
J. Graph Theory, 2017

Clique cutsets beyond chordal graphs.
Electron. Notes Discret. Math., 2017

2016
Isolating Highly Connected Induced Subgraphs.
SIAM J. Discret. Math., 2016

Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable.
J. Graph Theory, 2016

Perfect graphs of arbitrarily large clique-chromatic number.
J. Comb. Theory, Ser. B, 2016

2013
The Structure of Bull-Free Perfect Graphs.
J. Graph Theory, 2013

Substitution and χ-boundedness.
J. Comb. Theory, Ser. B, 2013

Excluding four-edge paths and their complements
CoRR, 2013

2012
Coloring Bull-Free Perfect Graphs.
SIAM J. Discret. Math., 2012

Excluding Induced Subdivisions of the Bull and Related Graphs.
J. Graph Theory, 2012

2005
From finitary to infinitary second-order logic.
Math. Log. Q., 2005


  Loading...