Search results for "two-coloring"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
94	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating interval coloring and max-coloring in chordal graphs.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs
59	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating Interval Coloring and Max-Coloring in Chordal Graphs.	WEA	2004	DBLP DOI BibTeX RDF
22	Marco Chiarandini, Irina Dumitrescu, Thomas Stützle	Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems.	Hybrid Metaheuristics	2008	DBLP DOI BibTeX RDF
21	Jaikumar Radhakrishnan, Aravind Srinivasan	Improved Bounds and Algorithms for Hypergraph Two-Coloring.	FOCS	1998	DBLP DOI BibTeX RDF	Hypergraph coloring, The Probabilistic Method, Lovasz Local Lemma
21	Jirí Matousek 0001, Emo Welzl, Lorenz Wernisch	Discrepancy and epsilon-approximations for bounded VC-dimension	FOCS	1991	DBLP DOI BibTeX RDF	geometric settings, in -approximations, bounded VC-dimension, two-coloring, m-point subset, upper bounds, discrepancy, polylogarithmic factors
15	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur	Testing Properties of Constraint-Graphs.	CCC	2007	DBLP DOI BibTeX RDF
15	Jirí Matousek 0001	On the Signed Domination in Graphs.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C78, 05D15
13	Jaikumar Radhakrishnan, Aravind Srinivasan	Property B: Two-Coloring Non-Uniform Hypergraphs.	FSTTCS	2021	DBLP DOI BibTeX RDF
13	Balázs Keszegh	Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Zdenek Dvorák 0001, Adam Kabela, Tomás Kaiser	Planar graphs have two-coloring number at most 8.	J. Comb. Theory, Ser. B	2018	DBLP DOI BibTeX RDF
13	Tomás Feder, Pavol Hell, Carlos S. Subi	Distance-Two Coloring of Barnette Graphs.	CCCG	2018	DBLP BibTeX RDF
13	Yaroslav Shitov	A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
13	Zhe Han, Mei Lu	Two coloring problems on matrix graphs.	Discret. Math. Algorithms Appl.	2016	DBLP DOI BibTeX RDF
13	Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat	Hypergraph Two-Coloring in the Streaming Model.	CoRR	2015	DBLP BibTeX RDF
13	Zdenek Dvorák 0001, Louis Esperet	Distance-two coloring of sparse graphs.	Eur. J. Comb.	2014	DBLP DOI BibTeX RDF
13	Bernard Ries	Complexity of two coloring problems in cubic planar bipartite mixed graphs.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
13	Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu	The Two-Coloring Number and Degenerate Colorings of Planar Graphs.	SIAM J. Discret. Math.	2009	DBLP DOI BibTeX RDF
13	Bernard Ries, Dominique de Werra	On two coloring problems in mixed graphs.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
13	Robert Berke, Tibor Szabó	Relaxed two-coloring of cubic graphs.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
13	Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali	Two-coloring random hypergraphs.	Random Struct. Algorithms	2002	DBLP DOI BibTeX RDF
13	Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali	Two-coloring Random Hypergraphs.	ICALP Satellite Workshops	2000	DBLP BibTeX RDF
13	Carsten Thomassen	Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.	J. Comb. Theory, Ser. B	1999	DBLP DOI BibTeX RDF
13	Sanjeev Saxena	Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
13	Michael Reid, Douglas S. Jungreis, Dave Witte	Distances forbidden by some two-coloring of Q2.	Discret. Math.	1990	DBLP DOI BibTeX RDF
13	George B. Purdy, John E. Wetzel	Two-coloring inequalities for Euclidean arrangements in general position.	Discret. Math.	1980	DBLP DOI BibTeX RDF
8	Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky	Optimal phase conflict removal for layout of dark field alternatingphase shifting masks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
8	Ping Gong 0004, Daoyun Xu	A New Lower Bound of Critical Function for (k, s)-SAT.	TAMC	2006	DBLP DOI BibTeX RDF
8	Gyula Károlyi, János Pach, Géza Tóth 0001, Pavel Valtr 0001	Ramsey-Type Results for Geometric Graphs, II.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF