On the complexity of vertex-coloring edge-weightings

On the complexity of vertex-coloring edge-weightings

Graphs and Algorithms

Bibliographic Details
Main Authors:	Andrzej Dudek, David Wajc
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-11-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/548/pdf

Similar Items

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

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

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

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

Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-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)

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

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

Vertex-colouring edge-weightings with two edge weights
by: Mahdad Khatirinejad, et al.
Published: (2012-01-01)

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

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

Edge condition for long cycles in bipartite graphs
by: Lech Adamus
Published: (2009-01-01)

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

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-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)

The largest singletons in weighted set partitions and its applications
by: Yidong Sun, et al.
Published: (2011-12-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

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

Digraph complexity measures and applications in formal language theory
by: Hermann Gruber
Published: (2012-11-01)

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
by: Thomas P. Hayes
Published: (2011-11-01)

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
by: Dariusz Kowalski, et al.
Published: (2013-11-01)

Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
by: Akos Seress, et al.
Published: (2010-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

On the length of shortest 2-collapsing words
by: Alessandra Cherubini, et al.
Published: (2009-01-01)

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

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

On the number of maximal independent sets in a graph
by: David R. Wood
Published: (2011-09-01)

Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01)

Independent sets in graphs with an excluded clique minor
by: David R. Wood
Published: (2007-01-01)

On the Book Thickness of k-Trees
by: Vida Dujmović, et al.
Published: (2011-10-01)

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

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

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

On the residual solvability of generalized free products of solvable groups
by: Delaram Kahrobaei, et al.
Published: (2011-11-01)

On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01)

The extended equivalence and equation solvability problems for groups
by: Gabor Horvath, et al.
Published: (2011-11-01)