476 citations
- New York UniversityUS42 papers
- Courant Institute of Mathematical SciencesUS13 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- Fraunhofer Institute for Integrated CircuitsDE12 papers
- University of KonstanzDE12 papers
- University of StuttgartDE12 papers
- Technische Universität BerlinDE10 papers
- Universität HamburgDE10 papers
- Humboldt-Universität zu BerlinDE9 papers
- Occidental CollegeUS9 papers
- Chemnitz University of TechnologyDE8 papers
- Freie Universität BerlinDE8 papers
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013★ 1 cited
Thoughts on Barnette's Conjecture
Helmut Alt, Michael S. Payne, Jens M. Schmidt +1
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let be a pl…
math.CO2013
Total Thue colourings of graphs
Jens Schreyer, Erika Škrabuľáková
A total colouring of a graph is a colouring of its vertices and edges such that no two adjacent vertices or edges have the same colour and moreover, no edge coloured has its en…
math.CO2013★ 3 cited
On the facial Thue choice number of plane graphs via entropy compression method
Jakub Przybyło, Jens Schreyer, Erika Škrabuľáková
Let be a plane graph. A vertex-colouring of is called {\em facial non-repetitive} if for no sequence , , of consecutive vertex colours of…