Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.3580
Publisher DOI: 10.7155/jgaa.00552
Title: Circumference of essentially 4-connected planar triangulations
Language: English
Authors: Fabrici, Igor 
Harant, Jochen 
Mohr, Samuel 
Schmidt, Jens M.  
Keywords: circumference;long cycle;triangulation;essentially 4-connected;planar graph 2010 MSC: 05C38, 05C10
Issue Date: Jan-2021
Source: Journal of graph algorithms and applications 25 (1): 121-132 (2021)
Journal: Journal of graph algorithms and applications 
URI: http://hdl.handle.net/11420/8419
DOI: 10.15480/882.3580
ISSN: 1526-1719
Institute: Algorithmen und Komplexität E-11 
Document Type: Article
Project: Probleme der Strukturellen und Chromatischen Graphentheorie 
License: CC BY 4.0 (Attribution) CC BY 4.0 (Attribution)
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
552.pdfVerlags-PDF348,82 kBAdobe PDFView/Open
Thumbnail
Show full item record

Page view(s)

109
Last Week
5
Last month
18
checked on Dec 8, 2021

Download(s)

24
checked on Dec 8, 2021

Google ScholarTM

Check

Note about this record

Cite this record

Export

This item is licensed under a Creative Commons License Creative Commons