CHROMATIC THRESHOLDS IN DENSE RANDOM GRAPHS arXiv:1508.03870v1 [math.CO] 16 Aug 2015 ¨ PETER ALLEN, JULIA BOTTCHER,

Source URL: arxiv.org

The Chromatic Index of a Graph Whose Core has Maximum Degree 2 ∗† S. Akbaria,d , M. Ghanbarib,d , M. Kanoc , M. J. Nikmehrb a

Source URL: gorogoro.cis.ibaraki.ac.jp

POTTS PARTITION FUNCTION AND ISOMORPHISMS OF TREES ´ MARTIN LOEBL AND JEAN-SEBASTIEN SERENI Abstract. We explore the well-known Stanley conjecture stating that the symmetric chromatic polynomial distinguishes nonisomorp

Source URL: iti.mff.cuni.cz

The packing chromatic number of infinite product graphs∗ Jiˇr´ı Fiala a

Source URL: iti.mff.cuni.cz

Subcubic triangle-free graphs have fractional chromatic number at most 14/5∗ Zdenˇek Dvoˇra´k† Jean-S´ebastien Sereni‡

Source URL: iti.mff.cuni.cz

A combinatorial classic - sparse graphs with high chromatic number Jaroslav Neˇsetˇril∗ Computer Sience Institute of Charles University and Institute for Theoretical Computer Science (ITI)

Source URL: iti.mff.cuni.cz

A note on packing chromatic number of the square lattice Roman Soukal 1

Source URL: iti.mff.cuni.cz

reg4-n50-c512M-b1M.time.ps

Source URL: homepages.ecs.vuw.ac.nz

• Graph theory
• Graph coloring
• Matroid theory
• Polynomials
• Tutte polynomial
• Chromatic polynomial
• Matching
• Ear decomposition
• Spanning tree
• Graph
• Degree
• Connected component

A New Upper Bound on the Cyclic Chromatic Number O. V. Borodin,1 H. J. Broersma,2 1

Source URL: www.cdam.lse.ac.uk

An Application of Stahl’s Conjecture About the k-tuple Chromatic Numbers of Kneser Graphs Svata Poljak and Fred S. Roberts∗ Abstract A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G so th

Source URL: www.dimacs.rutgers.edu