default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrena Penev
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Irena Penev
:
Coloring (4K1,C4,C6)-free graphs. Discret. Math. 346(11): 113225 (2023)- [i3]Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic:
Bisimplicial separators. CoRR abs/2312.10830 (2023) - 2022
- [j17]Irena Penev:
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs. J. Graph Theory 99(3): 435-460 (2022) - 2021
- [j16]Frédéric Maffray, Irena Penev, Kristina Vuskovic:
Coloring rings. J. Graph Theory 96(4): 642-683 (2021) - 2020
- [j15]Irena Penev:
On the clique-width of (4K1, C4, C5, C7)-free graphs. Discret. Appl. Math. 285: 688-690 (2020) - [j14]Kathie Cameron, Shenwei Huang, Irena Penev, Vaidy Sivaraman:
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93(4): 503-552 (2020)
2010 – 2019
- 2019
- [j13]Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
Clique-cutsets beyond chordal graphs. J. Graph Theory 91(2): 192-246 (2019) - 2018
- [j12]Martin Milanic, Irena Penev, Nicolas Trotignon:
Stable Sets in {ISK4, wheel}-Free Graphs. Algorithmica 80(2): 415-447 (2018) - 2017
- [j11]Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
Clique cutsets beyond chordal graphs. Electron. Notes Discret. Math. 62: 81-86 (2017) - [j10]Irena Penev:
Amalgams and χ-Boundedness. J. Graph Theory 84(1): 57-92 (2017) - [j9]Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with No Induced Five-Vertex Path or Antipath. J. Graph Theory 84(3): 221-232 (2017) - 2016
- [j8]Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory B 116: 456-464 (2016) - [j7]Irena Penev:
Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable. J. Graph Theory 81(3): 213-235 (2016) - [j6]Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Isolating Highly Connected Induced Subgraphs. SIAM J. Discret. Math. 30(1): 592-619 (2016) - 2014
- [i2]Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with no induced five-vertex path or antipath. CoRR abs/1410.0871 (2014) - 2013
- [j5]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Substitution and χ-boundedness. J. Comb. Theory B 103(5): 567-586 (2013) - [j4]Maria Chudnovsky, Irena Penev:
The Structure of Bull-Free Perfect Graphs. J. Graph Theory 74(1): 1-31 (2013) - [i1]Maria Chudnovsky, Peter Maceli, Irena Penev:
Excluding four-edge paths and their complements. CoRR abs/1302.0405 (2013) - 2012
- [j3]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71(1): 49-68 (2012) - [j2]Irena Penev:
Coloring Bull-Free Perfect Graphs. SIAM J. Discret. Math. 26(3): 1281-1309 (2012)
2000 – 2009
- 2005
- [j1]George Weaver, Irena Penev:
From finitary to infinitary second-order logic. Math. Log. Q. 51(5): 499-506 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
