CHARACTERIZATION OF CYCLE OBSTRUCTION SETS FOR IMPROPER COLORING PLANAR GRAPHS

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 73
  • Download : 0
For nonnegative integers k, d(1),...,d(k), a graph is (d(1),...,d(k))-colorable if its vertex set can be partitioned into k parts so that the ith part induces a graph with maximum degree at most d(i) for all i is an element of{1,...,k}. A class C of graphs is balanced k-partitionable and unbalanced k-partitionable if there exists a nonnegative integer D such that all graphs in C are (D,...,D)-colorable and (0,...,0, D)-colorable, respectively, where the tuple has length k. A set X of cycles is a cycle obstruction set of a class C of planar graphs if every planar graph containing none of the cycles in X as a subgraph belongs to C. This paper characterizes all cycle obstruction sets of planar graphs to be balanced k-partitionable and unbalanced k-partitionable for all k; namely, we identify all inclusionwise minimal cycle obstruction sets for all k.
Publisher
SIAM PUBLICATIONS
Issue Date
2018-06
Language
English
Article Type
Article
Citation

SIAM JOURNAL ON DISCRETE MATHEMATICS, v.32, no.2, pp.1209 - 1228

ISSN
0895-4801
DOI
10.1137/16M1106882
URI
http://hdl.handle.net/10203/244693
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0