scholarly journals Improper coloring of graphs on surfaces

2018 ◽  
Vol 91 (1) ◽  
pp. 16-34 ◽  
Author(s):  
Ilkyoo Choi ◽  
Louis Esperet
Keyword(s):  
Improper Coloring ◽  
Graphs On Surfaces

scholarly journals Polynomial invariants of graphs on surfaces

10.4171/qt/35 ◽  
2013 ◽  
Vol 4 (1) ◽  
pp. 77-90 ◽  
Author(s):  
Ross Askanazi ◽  
Sergei Chmutov ◽  
Charles Estill ◽  
Jonathan Michel ◽  
Patrick Stollenwerk
Keyword(s):  
Polynomial Invariants ◽  
Graphs On Surfaces

scholarly journals The Jones polynomial and graphs on surfaces

2008 ◽  
Vol 98 (2) ◽  
pp. 384-399 ◽  
Author(s):  
Oliver T. Dasbach ◽  
David Futer ◽  
Efstratia Kalfagianni ◽  
Xiao-Song Lin ◽  
Neal W. Stoltzfus
Keyword(s):  
Jones Polynomial ◽  
Graphs On Surfaces

scholarly journals A note on list improper coloring of plane graphs

2009 ◽  
Vol 157 (2) ◽  
pp. 433-436 ◽  
Author(s):  
Wei Dong ◽  
Baogang Xu
Keyword(s):  
Plane Graphs ◽  
Improper Coloring

Coloring Graphs on Surfaces

2019 ◽  
pp. 205-222
Author(s):  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Graphs On Surfaces

scholarly journals Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces

10.37236/3540 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Dong Ye ◽  
Heping Zhang
Keyword(s):  
Bipartite Graph ◽  
Polynomial Time ◽  
Perfect Matching ◽  
Cartesian Product ◽  
Perfect Matchings ◽  
Face Width ◽  
Graphs On Surfaces ◽  
Positive Genus ◽  
Pfaffian Graph

A graph $G$ with a perfect matching is Pfaffian if it admits an orientation $D$ such that every central cycle $C$ (i.e. $C$ is of even size and $G-V(C)$ has a perfect matching) has an odd number of edges oriented in either direction of the cycle. It is known that the number of perfect matchings of a Pfaffian graph can be computed in polynomial time. In this paper, we show that every embedding of a Pfaffian brace (i.e. 2-extendable bipartite graph)  on a surface with a positive genus has face-width at most 3.  Further, we study Pfaffian cubic braces and obtain a characterization of Pfaffian polyhex graphs: a polyhex graph is Pfaffian if and only if it is either non-bipartite or isomorphic to the cube, or the Heawood graph, or the Cartesian product $C_k\times K_2$ for even integers $k\ge 6$.

scholarly journals Robust Connectivity of Graphs on Surfaces

2021 ◽  
pp. 848-854
Author(s):  
Peter Bradshaw ◽  
Tomáš Masařík ◽  
Jana Novotná ◽  
Ladislav Stacho
Keyword(s):  
Graphs On Surfaces

scholarly journals Lazy Cops and Robbers played on random graphs and graphs on surfaces

2016 ◽  
Vol 7 (4) ◽  
pp. 627-642 ◽  
Author(s):  
Deepak Bal ◽  
Anthony Bonato ◽  
William B. Kinnersley ◽  
Paweł Prałat
Keyword(s):  
Random Graphs ◽  
Cops And Robbers ◽  
Graphs On Surfaces

scholarly journals The evolution of random graphs on surfaces

2017 ◽  
Vol 61 ◽  
pp. 367-373
Author(s):  
Chris Dowden ◽  
Mihyun Kang ◽  
Philipp Sprüssel
Keyword(s):  
Random Graphs ◽  
Graphs On Surfaces

Coloring Triangle-Free Graphs on Surfaces

2007 ◽  
pp. 2-4
Author(s):  
Zdeněk Dvořák ◽  
Daniel Král’ ◽  
Robin Thomas
Keyword(s):  
Graphs On Surfaces
Sign in / Sign up

Export Citation Format

Share Document