General Parity Result and Cycle‐Plus‐Triangles Graphs

DOI10.1002/jgt.22107zbMath1368.05054arXiv1512.06205OpenAlexW2962702708MaRDI QIDQ4978447

Fedor Petrov

Publication date: 10 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06205

zbMATH Keywords

polynomial methodparitygraph choosability

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• A generalization of combinatorial Nullstellensatz
• Colorings and orientations of graphs
• A solution to a colouring problem of P. Erdős
• Partitions of nonzero elements of a finite field into pairs
• Combinatorial Nullstellensatz

This page was built for publication: General Parity Result and Cycle‐Plus‐Triangles Graphs