The following pages link to Martin Knor (Q335340):
Displaying 50 items.
- (Q186117) (redirect page) (← links)
- (Q1129809) (redirect page) (← links)
- Orientations of graphs with maximum Wiener index (Q335342) (← links)
- Distances on nanotubical structures (Q338805) (← links)
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470) (← links)
- Hyperbolic analogues of fullerenes on orientable surfaces (Q409420) (← links)
- On a conjecture about Wiener index in iterated line graphs of trees (Q409441) (← links)
- Efficient domination in cubic vertex-transitive graphs (Q449200) (← links)
- Biembeddings of metacyclic groups and triangulations of orientable surfaces by complete graphs (Q456361) (← links)
- Sandwiching the (generalized) Randić index (Q479035) (← links)
- Hyperbolic analogues of fullerenes with face-types (6, 9) and (6, 10) (Q501035) (← links)
- The critical \(Z\)-invariant Ising model via dimers: Locality property (Q623347) (← links)
- A study of 3-arc graphs (Q628319) (← links)
- Cheeger constants, growth and spectrum of locally tessellating planar graphs (Q636774) (← links)
- A quadratic algorithm for finding next-to-shortest paths in graphs (Q639280) (← links)
- A construction for biembeddings of Latin squares (Q640450) (← links)
- Some remarks on Wiener index of oriented graphs (Q668528) (← links)
- An inequality between the edge-Wiener index and the Wiener index of a graph (Q668722) (← links)
- Enumeration of acyclic walks in a graph (Q686419) (← links)
- The Wiener index in iterated line graphs (Q713319) (← links)
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs (Q777380) (← links)
- Distance based indices in nanotubical graphs. III (Q830871) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- On the second Laplacian eigenvalues of trees of odd order (Q865409) (← links)
- On conjugate adjacency matrices of a graph (Q868333) (← links)
- Generalised game colouring of graphs (Q878606) (← links)
- Spectral results on regular graphs with \((k,\tau)\)-regular sets (Q878619) (← links)
- Three-connected graphs whose maximum nullity is at most three (Q929488) (← links)
- Regular Hamiltonian embeddings of \(K_{n,n}\) and regular triangular embeddings of \(K_{n,n,n}\). (Q942113) (← links)
- On embeddings of snarks in the torus (Q952646) (← links)
- \(k\)-Ordered Hamilton cycles in digraphs (Q958680) (← links)
- A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- Diameter and connectivity of 3-arc graphs (Q1045140) (← links)
- On the ascending subgraph decompositions of regular graphs (Q1129810) (← links)
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor (Q1272538) (← links)
- Maximum degree growth of the iterated line graph (Q1295988) (← links)
- Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs (Q1297492) (← links)
- Hypergraph connectivity augmentation (Q1300056) (← links)
- On chordal proper circular arc graphs (Q1322203) (← links)
- A simple proof of the characterization of antipodal graphs (Q1322204) (← links)
- Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree (Q1331972) (← links)
- Toughness of graphs and \([2,b]\)-factors (Q1334935) (← links)
- A critically chromatic graph (Q1366769) (← links)
- On \(q\)-graphs (Q1366792) (← links)
- Hamiltonian-connected graphs and their strong closures (Q1380756) (← links)
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs (Q1402063) (← links)
- Decomposition of graphical sequences and unigraphs (Q1567622) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- New upper bounds for a canonical Ramsey problem (Q1586336) (← links)
- \(k\)-Lucas numbers and associated bipartite graphs (Q1593657) (← links)
