×

Found 22 Documents (Results 1–22)

The normal graph conjecture for classes of sparse graphs. (English) Zbl 1419.05088

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 39th international workshop, WG 2013, Lübeck, Germany, June 19–21, 2013. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 8165, 64-75 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. (English) Zbl 1423.05179

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1146-1155 (2009).
PDFBibTeX XMLCite
Full Text: Link

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

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software