MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Determining the Chromatic Number of a Graph." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

17 documents found, showing 1 through 10. Next 10 →

ATOM

An Example Program for the GRAPNEL Language: Chromatic Number of a Graph
by Edited By, Edited G'abor D'ozsa, Tibor Fadgyas
…. This presentation gives an in--detail elaborated example application for determin the chromatic number of a graph…
Add To MetaCart

On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case
by Richard Beigel, William I. Gasarch — 1989 — Annals of Pure and Applied Logic
…#ce, (2) determining if a recursive graph has a finite chromatic number is # 2 -complete, and (3) binary…
Cited by 16 (10 self) – Add To MetaCart

Nonlinear composites
by Perfectly Orderable P, Ryan B. Hayward, William J. Lenhart — 1998 — Advances in Appl. Mech
… words: P4, graph composition, perfect order, perfectly orderable Given that determining the chromatic…
Cited by 7 (0 self) – Add To MetaCart

Graph Coloring Problems and Their Applications in Scheduling
by Daniel Marx, D Aniel Marx — 2004 — in Proc. John von Neumann PhD Students Conference
…, determining the chromatic number of a graph is an NP-hard problem, hence we cannot expect to solve…
Cited by 4 (0 self) – Add To MetaCart

Joe Culberson's Graph Colouring Bibliography
by Joe Culberson, Robin J. Wilson, Graph Colourings, Haim Hanani, Norbert Sauer, Johanan Schonheim, English Summary — 1978
…:327--333, 1990. [304] D. Michael Miller. An algorithm for determining the chromatic number of a graph…
Add To MetaCart

Estimating the Computational Cost of Logic Programs
by S. K. Debray, P. López García, M. Hermenegildo, N.-W. Lin — 1994 — In Static Analysis Symposium, SAS’94, number 864 in LNCS
… the chromatic polynomial of a graph. Since the problem of determining the chromatic number of a graph is NP…
Cited by 24 (10 self) – Add To MetaCart

P. L'opez Garc'ia,
by S. K. Debray, M. Hermenegildo
… the problem of determining the chromatic number of a graph is NP-complete, that of determining chromatic…
Add To MetaCart

The GRED graphical editor for the GRADE parallel programming environment
by Péter Kacsuk, Gábor Dózsa, Tibor Fadgyas, Róbert Lovas — 1999 — FGCS journal, Special Issue on HighPerformance Computing and Networking
… complete graph is simply the number of its nodes. So, in order to determine the chromatic number of a graph…
Cited by 8 (7 self) – Add To MetaCart

Reciprocal expressions and the concept of reciprocity. Linguistics and Philosophy
by P. Berthomé, S. Lebresne, K. Nguy Ên — 1998 — in "Graph-Theoretic Concepts in Computer Science : 31st International Workshop (WG 2005), Metz (France)", Lecture Notes in Computer Science
… by Birkhoff and Lewis in 1946 [4], the chromatic polynomial of a graph G counts the number of ways of properly…
Cited by 1 (0 self) – Add To MetaCart

Approximate Graph Coloring by Semidefinite Programming
by David Karger, Rajeev Motwani, Madhu Sudan — 1994
…, and is usually denoted by (G). Determining the chromatic number of a graph is known to be NP-hard (cf. [19…
Cited by 128 (7 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB