31 citations · 298 across the 114 of their papers we have counts for
4 papers · 2 filters
Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita +2
We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the torus, with the exceptional graph class called "Petersen-like", is 3-edge-colorable. This me…
On a conjecture concerning 4-coloring of graphs with one crossing
Zdeněk Dvořák, Bernard Lidický, Bojan Mohar
We conjecture that every graph of minimum degree five with no separating triangles and drawn in the plane with one crossing is 4-colorable. In this paper, we use computer enumerati…
Vertex Partitioning and -Energy of Graphs
Saieed Akbari, Hitesh Kumar, Bojan Mohar +1
For a Hermitian matrix of order with eigenvalues , define \[ \mathcal{E}_p^+(A)=\sum_{λ_i > 0} λ_i^p(A), \quad \mathcal{E}_p^-(A)=\sum_{λ_i<0} |…
Hermitian adjacency matrices with at most three distinct eigenvalues
Saieed Akbari, Jonathan Aloni, Maxwell Levit +2
We study oriented graphs whose Hermitian adjacency matrices of the second kind have few eigenvalues. We give a complete characterization of the oriented graphs with two distinct ei…