The following pages link to Bojan Mohar (Q181823):
Displaying 50 items.
- Triangle-free subgraphs with large fractional chromatic number (Q322348) (← links)
- Drawing a disconnected graph on the torus (extended abstract) (Q324371) (← links)
- Obstructions for two-vertex alternating embeddings of graphs in surfaces (Q326654) (← links)
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- Integral Cayley multigraphs over abelian and Hamiltonian groups (Q396792) (← links)
- A note on forbidding clique immersions (Q396901) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Eigenvalues of graphs with vertices of large degree at distance three apart (Q414721) (← links)
- Two results on the digraph chromatic number (Q418896) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Spectrum of Cayley graphs on the symmetric group generated by transpositions (Q426095) (← links)
- Immersing complete digraphs (Q427820) (← links)
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- 5-choosability of graphs with crossings far apart (Q505910) (← links)
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- Toughness of \(K_{a,t}\)-minor-free graphs (Q554002) (← links)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (Q602728) (← links)
- An Eberhard-like theorem for pentagons and heptagons (Q603874) (← links)
- Rigidity and separation indices of graphs in surfaces (Q604979) (← links)
- Strengthened Brooks' theorem for digraphs of girth at least three (Q640457) (← links)
- Unexpected behaviour of crossing sequences (Q651034) (← links)
- 2-cell embeddings with prescribed face lengths and genus (Q659597) (← links)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← links)
- Combinatorial properties and the complexity of a max-cut approximation (Q685307) (← links)
- A polynomial time circle packing algorithm (Q686175) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466) (← links)
- (Q697073) (redirect page) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Strong embeddings of minimum genus (Q709302) (← links)
- Spectrally degenerate graphs: hereditary case (Q713975) (← links)
- Generating locally-cyclic triangulations of surfaces (Q757398) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- Heuristic search for Hamilton cycles in cubic graphs (Q864114) (← links)
- Research problems from the 5th Slovenian Conference (Bled, 2003) (Q864155) (← links)
- On the Laplacian coefficients of acyclic graphs (Q875026) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Hermitian adjacency spectrum and switching equivalence of mixed graphs (Q891549) (← links)
- On the sum of two largest eigenvalues of a symmetric matrix (Q952072) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- Eigenvalues and colorings of digraphs (Q962116) (← links)
- Topographical distance matrices for porous arrays (Q965856) (← links)
- Crossing-critical graphs with large maximum degree (Q974468) (← links)
- Erratum to: ``Topographical distance matrices for porous arrays'' (Q977071) (← links)
- On the sum of \(k\) largest eigenvalues of graphs and symmetric matrices (Q1003832) (← links)
- Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2] (Q1003835) (← links)
