Graph partitions with prescribed patterns
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10190777" target="_blank" >RIV/00216208:11320/14:10190777 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ejc.2013.06.043" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2013.06.043</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2013.06.043" target="_blank" >10.1016/j.ejc.2013.06.043</a>
Alternative languages
Result language
angličtina
Original language name
Graph partitions with prescribed patterns
Original language description
We discuss partition problems that generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. Depending on the pattern, we seek a finite forbidden induced subgraph characterization, or at least a polynomialtime algorithm. We give an overview of the current knowledge, focusing on open problems and recent breakthroughs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LL1201" target="_blank" >LL1201: Complex Structures: Regularities in Combinatorics and Discrete Mathematics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
—
Volume of the periodical
35
Issue of the periodical within the volume
January
Country of publishing house
GB - UNITED KINGDOM
Number of pages
19
Pages from-to
335-353
UT code for WoS article
000324786900028
EID of the result in the Scopus database
—