Standard

General Parity Result and Cycle-Plus-Triangles Graphs. / Petrov, Fedor.

In: Journal of Graph Theory, Vol. 85, No. 4, 01.08.2017, p. 803-807.

Research output: Contribution to journal › Article › peer-review

Harvard

Petrov, F 2017, 'General Parity Result and Cycle-Plus-Triangles Graphs', Journal of Graph Theory, vol. 85, no. 4, pp. 803-807. https://doi.org/10.1002/jgt.22107

APA

Petrov, F. (2017). General Parity Result and Cycle-Plus-Triangles Graphs. Journal of Graph Theory, 85(4), 803-807. https://doi.org/10.1002/jgt.22107

Vancouver

Petrov F. General Parity Result and Cycle-Plus-Triangles Graphs. Journal of Graph Theory. 2017 Aug 1;85(4):803-807. https://doi.org/10.1002/jgt.22107

Author

Petrov, Fedor. / General Parity Result and Cycle-Plus-Triangles Graphs. In: Journal of Graph Theory. 2017 ; Vol. 85, No. 4. pp. 803-807.

BibTeX

@article{cb286c3eb192497398750a4e8b509538,
title = "General Parity Result and Cycle-Plus-Triangles Graphs",
abstract = "We generalize a parity result of Fleishner and Stiebitz that being combined with Alon–Tarsi polynomial method allowed them to prove that a 4-regular graph formed by a Hamiltonian cycle and several disjoint triangles is always 3-choosable. Also we show how a version of polynomial method gives slightly more combinatorial information about colorings than direct application of Alon's Combinatorial Nullstellensatz.",
keywords = "graph choosability, parity, polynomial method",
author = "Fedor Petrov",
year = "2017",
month = aug,
day = "1",
doi = "10.1002/jgt.22107",
language = "English",
volume = "85",
pages = "803--807",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Blackwell",
number = "4",

}

RIS

TY - JOUR

T1 - General Parity Result and Cycle-Plus-Triangles Graphs

AU - Petrov, Fedor

PY - 2017/8/1

Y1 - 2017/8/1

N2 - We generalize a parity result of Fleishner and Stiebitz that being combined with Alon–Tarsi polynomial method allowed them to prove that a 4-regular graph formed by a Hamiltonian cycle and several disjoint triangles is always 3-choosable. Also we show how a version of polynomial method gives slightly more combinatorial information about colorings than direct application of Alon's Combinatorial Nullstellensatz.

AB - We generalize a parity result of Fleishner and Stiebitz that being combined with Alon–Tarsi polynomial method allowed them to prove that a 4-regular graph formed by a Hamiltonian cycle and several disjoint triangles is always 3-choosable. Also we show how a version of polynomial method gives slightly more combinatorial information about colorings than direct application of Alon's Combinatorial Nullstellensatz.

KW - graph choosability

KW - parity

KW - polynomial method

UR - http://www.scopus.com/inward/record.url?scp=85006456785&partnerID=8YFLogxK

U2 - 10.1002/jgt.22107

DO - 10.1002/jgt.22107

M3 - Article

AN - SCOPUS:85006456785

VL - 85

SP - 803

EP - 807

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -

ID: 36279958