An upper bound on the sum of powers of the degrees of simple 1-planar graphs
From MaRDI portal
Publication:2448897
DOI10.1016/j.dam.2012.11.001zbMath1288.05051MaRDI QIDQ2448897
Július Czap, Jochen Harant, David E. Hudak
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.11.001
Related Items
Upper bound on the sum of powers of the degrees of graphs with few crossings per edge, Degree powers in \(K_{s,t}\)-minor free graphs
Cites Work
- Unnamed Item
- 1-planarity of complete multipartite graphs
- Vertex degrees of planar graphs
- Coloring vertices and faces of locally planar graphs
- The structure of 1-planar graphs
- An inequality for degree sequences
- Graphs drawn with few crossings per edge
- An upper bound on the sum of squares of degrees in a hypergraph
- An upper bound on the sum of squares of degrees in a graph
- Which crossing number is it anyway?
- Maximizing the sum of the squares of the degrees of a graph
- Sums of powers of the degrees of a graph
- Upper bounds on the sum of powers of the degrees of a simple planar graph
- Moments of graphs in monotone families
- The crossing number of K5,n
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph