Available identifiers
zbMath Open penev.irenaMaRDI QIDQ461724
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Bisimplicial separators | 2023-12-17 | Paper |
| Coloring \((4K_1,C_4,C_6)\)-free graphs | 2023-11-27 | Paper |
| On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs | 2023-10-05 | Paper |
| Coloring rings | 2023-09-29 | Paper |
| On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs | 2020-08-31 | Paper |
| The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness | 2020-05-21 | Paper |
| Clique‐cutsets beyond chordal graphs | 2019-06-14 | Paper |
| Clique cutsets beyond chordal graphs | 2018-04-09 | Paper |
| Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs | 2018-04-06 | Paper |
| Graphs with No Induced Five‐Vertex Path or Antipath | 2017-04-21 | Paper |
| Amalgams and χ-Boundedness | 2017-02-01 | Paper |
| Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable | 2016-04-15 | Paper |
| Isolating Highly Connected Induced Subgraphs | 2016-04-07 | Paper |
| A decomposition theorem for {ISK4,wheel}-free trigraphs | 2016-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3466609 | 2016-02-01 | Paper |
| Perfect graphs of arbitrarily large clique-chromatic number | 2015-12-11 | Paper |
| Substitution and \(\chi\)-boundedness | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5411479 | 2014-04-23 | Paper |
| The Structure of Bull-Free Perfect Graphs | 2013-10-09 | Paper |
| Excluding four-edge paths and their complements | 2013-02-02 | Paper |
| Coloring Bull-Free Perfect Graphs | 2013-01-04 | Paper |
| Excluding Induced Subdivisions of the Bull and Related Graphs | 2012-09-12 | Paper |
| From finitary to infinitary second‐order logic | 2005-09-26 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Irena Penev
