Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
暂无分享,去创建一个
Frits C. R. Spieksma | Fabrice Talla Nobibon | Roel Leus | Cor A. J. Hurkens | F. Spieksma | F. T. Nobibon | R. Leus | C. Hurkens
[1] Frits C. R. Spieksma,et al. On the complexity of testing the Collective Axiom of Revealed Preference , 2010, Math. Soc. Sci..
[2] Michael Szenberg,et al. Samuelsonian Economics and the Twenty‐First Century , 2006 .
[3] Susmita Sur-Kolay,et al. Efficient Algorithms for Vertex Arboricity of Planar Graphs , 1995, FSTTCS.
[4] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[5] Frits C. R. Spieksma,et al. Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles , 2010, AAIM.
[6] Hal A. Kierstead,et al. The game of arboricity , 2008, Discret. Math..
[7] Trevor J. M. Bench-Capon. Value-based argumentation frameworks , 2002, NMR.
[8] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Vilhelm Dahllöf,et al. Exact Algorithms for , 2006 .
[11] Carsten Thomassen. 2-List-coloring planar graphs without monochromatic triangles , 2008, J. Comb. Theory, Ser. B.
[12] H. Varian. Revealed Preference , 2006 .
[13] Richard M. Karp,et al. The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.
[14] Yuan Jinjiang,et al. On the vertex arboricity of planar graphs of diameter two , 2007 .
[15] André Raspaud,et al. On the vertex-arboricity of planar graphs , 2008, Eur. J. Comb..
[16] Wayne Goddard,et al. Acyclic colorings of planar graphs , 1991, Discret. Math..
[17] Carsten Lund,et al. The Approximation of Maximum Subgraph Problems , 1993, ICALP.
[18] Rahul Deb,et al. An Efficient Nonparametric Test of the Collective Household Model , 2008 .
[19] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[20] Bram De Rock,et al. The collective model of household consumption , 2004 .
[21] Paolo Giulio Franciosa,et al. A characterization of partial directed line graphs , 2007, Discret. Math..
[22] Frits C. R. Spieksma,et al. Heuristics for Deciding Collectively Rational Consumption Behavior , 2008 .
[23] Erlendur S. Thorsteinsson. Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.
[24] Sanjeev Khanna,et al. On wireless spectrum estimation and generalized graph coloring , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[25] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[26] Jinjiang Yuan,et al. On the vertex arboricity of planar graphs of diameter two , 2007, Discret. Math..
[27] Gerhard J. Woeginger,et al. Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult , 2006, Algorithmica.
[28] Zhi-Zhong Chen,et al. Efficient Algorithms for Acyclic Colorings of Graphs , 1999, Theor. Comput. Sci..
[29] Vadim V. Lozin,et al. New Results on Generalized Graph Coloring , 2004, Discret. Math. Theor. Comput. Sci..
[30] Frits C. R. Spieksma,et al. Coloring Graphs While Avoiding Monochromatic Cycles , 2010 .
[31] Tad Hogg,et al. Refining the Phase Transition in Combinatorial Search , 1996, Artif. Intell..
[32] Laurens Cherchye,et al. Nonparametric Tests of Collectively Rational Consumption Behavior: An Integer Programming Procedure , 2008 .
[33] Gerald E. Farin,et al. Class A Bézier curves , 2006, Comput. Aided Geom. Des..