The following pages link to Bojan Mohar (Q181823):
Displaying 50 items.
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes (Q1003838) (← links)
- A generalization of Kneser's addition theorem (Q1007230) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- A common cover of graphs and 2-cell embeddings (Q1057277) (← links)
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs (Q1058530) (← links)
- Akempic triangulations with 4 odd vertices (Q1062068) (← links)
- The enumeration of akempic triangulations (Q1065015) (← links)
- The Cartesian product of three triangles can be embedded into a subspace of genus 7 (Q1068095) (← links)
- On the cycle space of graphs (Q1068840) (← links)
- Simplicial schemes (Q1068841) (← links)
- Embeddings of infinite graphs (Q1074594) (← links)
- Nonorientable genus of nearly complete bipartite graphs (Q1092915) (← links)
- The maximum genus of graph bundles (Q1101120) (← links)
- The matching polynomial of a polygraph (Q1103634) (← links)
- Walk generating functions and spectral measures of infinite graphs (Q1108292) (← links)
- Isoperimetric inequalities, growth, and the spectrum of graphs (Q1111573) (← links)
- Disjoint essential cycles (Q1125961) (← links)
- The spectrum of an infinite graph (Q1172649) (← links)
- Eigenvalues, diameter, and mean distance in graphs (Q1175553) (← links)
- Some relations between analytic and geometric properties of infinite graphs (Q1191921) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- A domain monotonicity theorem for graphs and Hamiltonicity (Q1192950) (← links)
- Signed graphs with least eigenvalue \(<-2\) (Q1193558) (← links)
- 7-critical graphs of bounded genus (Q1210575) (← links)
- An obstruction to embedding graphs in surfaces (Q1262320) (← links)
- The Grötzsch theorem for the hypergraph of maximal cliques (Q1292236) (← links)
- (Q1309468) (redirect page) (← links)
- Covering spaces of locally homogeneous graphs (Q1309469) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- Lower bound for the norm of a vertex-transitive graph (Q1319328) (← links)
- Coloring graphs without short non-bounding cycles (Q1322020) (← links)
- Overlap matrices and total imbedding distributions (Q1322173) (← links)
- Unimodular congruence of the Laplacian matrix of a graph (Q1329994) (← links)
- A note on unimodular congruence of graphs (Q1329996) (← links)
- Surface triangulations with isometric boundary (Q1339862) (← links)
- On approximating the maximum diameter ratio of graphs (Q1349101) (← links)
- Coloring Eulerian triangulations of the projective plane (Q1349103) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- A Faber-Krahn-type inequality for regular trees (Q1355455) (← links)
- Circle packings of maps in polynomial time (Q1372615) (← links)
- A new upper bound for the isoperimetric number of de Bruijn networks (Q1375854) (← links)
- Distance-related invariants on polygraphs (Q1377616) (← links)
- Apex graphs with embeddings of face-width three (Q1377691) (← links)
- On the orientable genus of graphs with bounded nonorientable genus (Q1379843) (← links)
- Tesselation and visibility representations of maps on the torus (Q1380779) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Projective plan and Möbius band obstructions (Q1385984) (← links)
- On a list-coloring problem (Q1398274) (← links)
- Blocking nonorientability of a surface (Q1403908) (← links)
- Domination, packing and excluded minors (Q1408550) (← links)
