×

Found 22 Documents (Results 1–22)

Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c\le 12\). (English) Zbl 07559214

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 14, 15 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Structure and generation of crossing-critical graphs. (English) Zbl 1489.68190

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 33, 14 p. (2018).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). (English) Zbl 1273.05132

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 101-105 (2009).
MSC:  05C50 05C10 05C63
PDFBibTeX XMLCite
Full Text: DOI

Coloring triangle-free graphs on surfaces. (English) Zbl 1193.05075

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 2-4 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field