The incidence matrices of various graphs are considered. By reordering the points, the bandwidth can be changed. In the cases of rectangular grids in the plane or cubic grids in three dimensions, the ...

Carpathian Journal of Mathematics, Vol. 39, No. 2 (2023), pp. 371-382 (12 pages) The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. In ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

Researchers have proved a special case of the Erdős-Hajnal conjecture, which shows what happens in graphs that exclude anything resembling a pentagon. When you walk into a room full of people, you can ...