Strong parity vertex coloring of plane graphs

Strong parity vertex coloring of plane graphs

Show other versions (1)

Graph Theory

Bibliographic Details
Main Authors:	Tomas Kaiser, Ondrej Rucky, Matej Stehlik, Riste Škrekovski
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2014-03-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/1268/pdf

Similar Items

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

A bound on the number of perfect matchings in Klee-graphs
by: Marek Cygan, et al.
Published: (2013-01-01)

On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01)

Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-01)

Long cycles in hypercubes with distant faulty vertices
by: Petr Gregor, et al.
Published: (2009-01-01)

Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01)

All totally symmetric colored graphs
by: Mariusz Grech, et al.
Published: (2013-03-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)

Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)

Irregular edge coloring of 2-regular graphs
by: Sylwia Cichacz, et al.
Published: (2011-02-01)

On paths, trails and closed trails in edge-colored graphs
by: Laurent Gourvès, et al.
Published: (2012-09-01)

A note on compact and compact circular edge-colorings of graphs
by: Dariusz Dereniowski, et al.
Published: (2008-01-01)

Some results on stable sets for k-colorable P₆-free graphs and generalizations
by: Raffaele Mosca
Published: (2012-08-01)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
by: Gábor Bacsó, et al.
Published: (2009-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)

Nonrepetitive colorings of lexicographic product of graphs
by: Balázs Keszegh, et al.
Published: (2014-10-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Binary Labelings for Plane Quadrangulations and their Relatives
by: Stefan Felsner, et al.
Published: (2011-01-01)

Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Generation of Cubic graphs
by: Gunnar Brinkmann, et al.
Published: (2011-07-01)

On the tileability of polygons with colored dominoes
by: Chris Worman, et al.
Published: (2007-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

On the metric dimension of Grassmann graphs
by: Robert F. Bailey, et al.
Published: (2012-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

On 4-valent Frobenius circulant graphs
by: Sanming Zhou
Published: (2012-10-01)

Progress on the traceability conjecture for oriented graphs
by: Marietjie Frick, et al.
Published: (2008-01-01)

Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01)

Upper k-tuple domination in graphs
by: Gerard Jennhwa Chang, et al.
Published: (2012-12-01)

Cycle transversals in bounded degree graphs
by: Marina Groshaus, et al.
Published: (2011-03-01)

The Erdős-Sós conjecture for geometric graphs
by: Luis Barba, et al.
Published: (2013-02-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)