A survey of graphs with known or bounded crossing numbers (Q5139701)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7283887

Language	Label	Description	Also known as
English	A survey of graphs with known or bounded crossing numbers	scientific article; zbMATH DE number 7283887

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

0 references

Michael Haythorpe

0 references

0 references

publication date

10 December 2020

0 references

full work available at URL

https://arxiv.org/abs/1901.05155

0 references

http://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p209.pdf

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

planar crossing numbers

0 references

graph products

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

arXiv classification

math.CO

0 references

0 references

On topological graphs with at most four crossings per edge

0 references

Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\).

0 references

Proofs from THE BOOK

0 references

Crossing-Free Subgraphs

0 references

A group-theoretic model for symmetric interconnection networks

0 references

Crossings, colorings, and cliques

0 references

0 references

0 references

The crossing number ofK1,3,n andK2,3,n

0 references

Closing in on Hill's Conjecture

0 references

Towards the Albertson conjecture

0 references

On the crossing numbers of products of cycles and graphs of order four

0 references

The early history of the brick factory problem

0 references

Permutation Groups, Complexes, and Rearrangeable Connecting Networks

0 references

On the crossing numbers of Cartesian products with paths

0 references

On the crossing numbers of Cartesian products with trees

0 references

0 references

An ILP-based Proof System for the Crossing Number Problem

0 references

Augmented cubes

0 references

Zarankiewicz's conjecture is finite for each fixed \(m\)

0 references

0 references

0 references

An effective crossing minimisation heuristic based on star insertion

0 references

Self-dual configurations and regular graphs

0 references

Improved Bounds for the Crossing Numbers of Km,n and Kn

0 references

Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation

0 references

The crossing number of c<sub>4</sub> × c<sub>4</sub>

0 references

The crossing numbers of join of some graphs with \(n\) isolated vertices

0 references

0 references

The crossing number of G ▭ C n for the graph G on six vertices

0 references

0 references

On the crossing numbers of G□ Cn for graphs G on six vertices

0 references

Crossing Number Problems

0 references

The crossing numbers of some generalized Petersen graphs.

0 references

0 references

An improved upper bound on the crossing number of the hypercube

0 references

0 references

0 references

0 references

Crossing Number is NP-Complete

0 references

0 references

On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs

0 references

The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)

0 references

0 references

0 references

On the Möbius Ladders

0 references

The crossing number of the complement of a circuit

0 references

0 references

On the Number of Crossings in a Complete Graph

0 references

0 references

0 references

0 references

Über die Kreuzungszahl vollständiger, <i>n</i>‐geteilter Graphen

0 references

ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH

0 references

0 references

0 references

0 references

0 references

The crossing number of \(C(3k+1;\{1,k\})\)

0 references

The crossing number of \(K_{1,m,n}\)

0 references

0 references

On the crossing number of some complete multipartite graphs

0 references

0 references

0 references

0 references

The crossing number of \(K_{1,4,n}\)

0 references

Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable

0 references

0 references

Crossing numbers of Sierpiński‐like graphs

0 references

The crossing number of K5,n

0 references

0 references

The crossing numbers of products of paths and stars with 4‐vertex graphs

0 references

The crossing numbers of certain Cartesian products

0 references

0 references

0 references

The crossing numbers of products of a 5-vertex graph with paths and cycles

0 references

On the crossing numbers of products of stars and graphs of order five

0 references

The crossing numbers of Cartesian products of paths with 5-vertex graphs

0 references

The crossing number of \(K_{2,3}{\times}C_{3}\)

0 references

Some crossing numbers of products of cycles

0 references

The Join of Graphs and Crossing Numbers

0 references

On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices

0 references

The crossing numbers of join of the special graph on six vertices with path and cycle

0 references

The crossing numbers of products of 5-vertex graphs with cycles

0 references

0 references

The crossing number of \(P^2_n \square C_3\)

0 references

0 references

The crossing numbers of products of path with graphs of order six

0 references

0 references

On the crossing numbers of Cartesian products of wheels and trees

0 references

The crossing number ofC5 �Cn

0 references

The crossing numbers of join products of paths with graphs of order four

0 references

On the crossing numbers of Cartesian products of stars and graphs of order six

0 references

New lower bound techniques for VLSI

0 references

0 references

0 references

The crossing number of \(C(mk;\{1,k\})\)

0 references

0 references

The crossing numbers of generalized Petersen graphs with small order

0 references

0 references

0 references

0 references

0 references

The crossing number of the circular graph \(C(2m+2,m)\)

0 references

Bounds for the crossing number of the <i>N</i>‐cube

0 references

0 references

On the crossing number of \(K_{13}\)

0 references

On the crossing numbers of certain generalized Petersen graphs

0 references

0 references

An improvement of the crossing number bound

0 references

On the crossing number of \(K_{m,n}\)

0 references

Coloring graphs with crossings

0 references

&lt;italic&gt;K&lt;/italic&gt;&lt;sub&gt;1,1,&lt;italic&gt;m&lt;/italic&gt;&lt;/sub&gt;□&lt;italic&gt;P&lt;/italic&gt;&lt;sub&gt;&lt;italic&gt;n&lt;/italic&gt;&lt;/sub&gt; 的交叉数

0 references

The crossing number of the Cartesian product of paths with complete graphs

0 references

The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle

0 references

0 references

Improving the crossing lemma by finding more crossings in sparse graphs

0 references

Graphs drawn with few crossings per edge

0 references

The crossing number of <i>K</i><sub>11</sub> is 100

0 references

0 references

0 references

0 references

0 references

0 references

The crossing number of \(P(N,3)\)

0 references

Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)

0 references

The crossing number of \(C_3\times C_n\)

0 references

THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS

0 references

Infinite families of crossing-critical graphs with given average degree

0 references

A lower bound for the crossing number ofCm � Cn

0 references

On the crossing numbers of loop networks and generalized Petersen graphs

0 references

An improved bound for the crossing number of \(C_m\times C_n\): a self-contained proof using mostly combinatorial arguments

0 references

0 references

The graph crossing number and its variants: a survey

0 references

Crossing Numbers of Graphs

0 references

Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces

0 references

DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS

0 references

Determining crossing number of join of the discrete graph with two symmetric graphs of order five

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

On crossing numbers of hypercubes and cube connected cycles

0 references

The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\)

0 references

An upper bound for the crossing number of augmented cubes

0 references

0 references

The crossing number of folded hypercubes

0 references

0 references

0 references

0 references

The crossing number of the hexagonal graph \(H_{3,n}\)

0 references

0 references

The crossing number of Cartesian product of 5-wheel with any tree

0 references

A theorem on tait colorings with an application to the generalized Petersen graphs

0 references

Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture

0 references

0 references

0 references

The locally twisted cubes

0 references

The crossing number of \(C(n; \{1,3\})\)

0 references

The crossing number of pancake graph $P_4$ is six

0 references

0 references

0 references

0 references

0 references

0 references

0 references

The crossing number of \(C(8,2)\square P_{n}\)

0 references

0 references

On a problem of P. Turan concerning graphs

0 references

0 references

On the crossing number of \(K_{ m } \square P_{n}\)

0 references

On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

一个特殊6点图Q与nK_{1}, P_{n}及C_{n}的联图交叉数

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5139701

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5139701&oldid=36638750"