Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Brause, Christoph | |
| dc.contributor.author | Doan, Trung Duy | |
| dc.contributor.author | Holub, Přemysl | |
| dc.contributor.author | Kabela, Adam | |
| dc.contributor.author | Ryjáček, Zdeněk | |
| dc.contributor.author | Schiermeyer, Ingo | |
| dc.contributor.author | Vrána, Petr | |
| dc.date.accessioned | 2022-09-12T10:00:22Z | - |
| dc.date.available | 2022-09-12T10:00:22Z | - |
| dc.date.issued | 2022 | |
| dc.identifier.citation | BRAUSE, CH. DOAN, TD. HOLUB, P. KABELA, A. RYJÁČEK, Z. SCHIERMEYER, I. VRÁNA, P. Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. DISCRETE MATHEMATICS, 2022, roč. 345, č. 6, s. nestránkováno. ISSN: 0012-365X | cs |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.uri | 2-s2.0-85125796942 | |
| dc.identifier.uri | http://hdl.handle.net/11025/49630 | |
| dc.format | 8 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Discrete Mathematics | en |
| dc.rights | © authors | en |
| dc.title | Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 | en |
| dc.type | postprint | cs |
| dc.type | postprint | en |
| dc.rights.access | openAccess | en |
| dc.type.version | acceptedVersion | en |
| dc.description.abstract-translated | For every graph X, we consider the class of all connected {K(1,3), X}-free graphs which are distinct from an odd cycle and have independence number at least 4, and we show that all graphs in the class are perfect if and only if X is an induced subgraph of some of P6, K1 ∪ P5, 2P3, Z2 or K1 ∪ Z1. Furthermore, for X chosen as 2K1 ∪ K3, we list all eight imperfect graphs belonging to the class; and for every other choice of X, we show that there are infinitely many such graphs. In addition, for X chosen as B(1,2), we describe the structure of all imperfect graphs in the class. | en |
| dc.subject.translated | perfect graphs | en |
| dc.subject.translated | vertex colouring | en |
| dc.subject.translated | forbidden induced subgraphs | en |
| dc.identifier.doi | 10.1016/j.disc.2022.112837 | |
| dc.type.status | Peer-reviewed | en |
| dc.identifier.document-number | 784329800017 | |
| dc.identifier.obd | 43936405 | |
| dc.project.ID | GA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafy | cs |
| dc.project.ID | 7AMB16DE001/Colourings and connection in graphs | cs |
| Vyskytuje se v kolekcích: | Postprinty / Postprints (KMA) OBD | |
Soubory připojené k záznamu:
| Soubor | Velikost | Formát | |
|---|---|---|---|
| 2102.08783.pdf | 521,46 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/49630Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.