New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree

Abstract

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph of minimum degree 6 contains a copy of 4-cycle with all vertices of degree at most 19. In addition, we also show that the complete graph K 4 is light in the family of 1-planar graphs of minimum degree 7, with its height at most 11.
Fichier principal
Vignette du fichier
1527-6454-1-PB.pdf (240.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00990621 , version 1 (13-05-2014)

Identifiers

Cite

Xin Zhang, Jian-Liang Wu, Guizhen Liu. New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 3 (3), pp.9--16. ⟨10.46298/dmtcs.560⟩. ⟨hal-00990621⟩

Collections

TDS-MACS
88 View
1004 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More