Result 1 to 20 from 78 total
Dynamic chromatic number of regular graphs. (English)
Discrete Appl. Math. 160, No. 15, 2098-2103 (2012).
1
From the plane to higher surfaces. (English)
J. Comb. Theory, Ser. B 102, No. 4, 852-868 (2012).
2
Computation with polynomial equations and inequalities arising in combinatorial optimization. (English)
Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17‒21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 447-481 (2012).
3
Forbidding and enforcing on graphs. (English)
Theor. Comput. Sci. 429, 108-117 (2012).
4
Graphs with odd cycle lengths 5 and 7 are 3-colorable. (English)
SIAM J. Discrete Math. 25, No. 3, 1069-1088 (2011).
5
Optical graph 3-colorability. (English)
Dolev, Shlomi (ed.) et al., Optical supercomputing. Third international workshop, OSC 2010, Bertinoro, Italy, November 17‒19, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-22493-5/pbk). Lecture Notes in Computer Science 6748, 16-22 (2011).
6
Defining languages by forbidding-enforcing systems. (English)
Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27‒July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 92-101 (2011).
7
Boundary properties of graphs for algorithmic graph problems. (English)
Theor. Comput. Sci. 412, No. 29, 3545-3554 (2011).
8
Inapproximability of $b$-matching in $k$-uniform hypergraphs. (English)
Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 57-69 (2011).
9
Digraphs are 2-weight choosable. (English)
Electron. J. Comb. 18, No. 1, Research Paper P21, 4 p., electronic only (2011).
10
Comparing the strength of query types in property testing: The case of testing $k$-colorability. (English)
Goldreich, Oded (ed.), Property testing. Current research and surveys. Berlin: Springer (ISBN 978-3-642-16366-1/pbk). Lecture Notes in Computer Science 6390, 253-259 (2010).
11
Reversed resolution in reducing general satisfiability problem. (English)
Stud. Log. 95, No. 3, 407-416 (2010).
12
Hadwiger’s conjecture and Seagull packing. (English)
Notices Am. Math. Soc. 57, No. 6, 733-736 (2010).
13
Why almost all $k$-colorable graphs are easy to color. (English)
Theory Comput. Syst. 46, No. 3, 523-565 (2010).
14
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. (English)
Discrete Math. 310, No. 1, 147-158 (2010).
15
Continuous sets of the boundary classes of graphs for coloring problems. (Russian)
Diskretn. Anal. Issled. Oper. 16, No. 5, 41-51 (2009).
16
On the infinity of the set of boundary classes for the edge 3-colorability problem. (Russian)
Diskretn. Anal. Issled. Oper. 16, No. 1, 37-43 (2009).
17
On the complexity of recognizing directed path families. (English)
Discrete Appl. Math. 157, No. 11, 2525-2535 (2009).
18
Mr. Paint and Mrs. Correct. (English)
Electron. J. Comb. 16, No. 1, Research Paper R77, 18 p. (2009).
19
DP-complete problems derived from extremal NP-complete properties. (English)
Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24‒28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 199-210 (2009).
20
Result 1 to 20 from 78 total
Start
Contact
Print
General Help
