×

Found 72 Documents (Results 1–72)

Clique and chromatic number of circular-perfect graphs. (English) Zbl 1237.90245

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 199-206 (2010).
MSC:  90C35 05C85 90C27
PDFBibTeX XMLCite
Full Text: DOI

On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. (English) Zbl 1268.05083

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 53-58 (2009).
MSC:  05C15 05C17
PDFBibTeX XMLCite
Full Text: DOI

Circular-imperfection of triangle-free graphs. (English) Zbl 1341.05093

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 163-167 (2007).
MSC:  05C17 05C15
PDFBibTeX XMLCite
Full Text: DOI

Circular chromatic number of triangle-free graphs with given maximum average degree (extended abstract). (English) Zbl 1291.05042

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 507-514 (2007).
MSC:  05C07 05C35 05C15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software