10.9k citations
- University of MichiganUS1.5k papers
- Michigan State UniversityUS1.5k papers
- Centre National de la Recherche ScientifiqueFR1.4k papers
- Lawrence Berkeley National LaboratoryUS1.4k papers
- McGill UniversityCA1.4k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.3k papers
- University of ManchesterGB1.3k papers
- University of LiverpoolGB1.3k papers
- University of TorontoCA1.3k papers
- University of OxfordGB1.3k papers
- TRIUMFCA1.3k papers
- Argonne National LaboratoryUS1.3k papers
18 papers · 2 filters
Comment on revised version of "The Hadamard circulant conjecture"
Robert Craigen, Jonathan Jedwab
The revised version of the claim by Hurley, Hurley and Hurley to have proved the circulant Hadamard matrix conjecture is mistaken.
Construction of locally plane graphs with many edges
Gábor Tardos
A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most in a geometric graph is self-intersecting we call -loca…
Planar graphs have exponentially many 3-arboricities
Ararat Harutyunyan, Bojan Mohar
It is well-known that every planar or projective planar graph can be 3-colored so that each color class induces a forest. This bound is sharp. In this paper, we show that there are…
Two results on the digraph chromatic number
Ararat Harutyunyan, Bojan Mohar
It is known (Bollobás (1978); Kostochka and Mazurova (1977)) that there exist graphs of maximum degree and of arbitrarily large girth whose chromatic number is at least $c Δ/ \…
Strengthened Brooks Theorem for digraphs of girth three
Ararat Harutyunyan, Bojan Mohar
Brooks' Theorem states that a connected graph of maximum degree has chromatic number at most , unless is an odd cycle or a complete graph. A result of Johansson (199…
Minimal obstructions for 1-immersions and hardness of 1-planarity testing
Vladimir P. Korzhik, Bojan Mohar
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar gra…