The following pages link to Erich Prisner (Q178604):
Displaying 50 items.
- (Q685667) (redirect page) (← links)
- A note on Frucht diagrams, Boolean graphs and Hamilton cycles (Q685668) (← links)
- Decomposition of 3-connected cubic graphs (Q685673) (← links)
- Absolute reflexive retracts and absolute bipartite retracts (Q686243) (← links)
- \(P_{2p}\)-factorization of a complete bipartite graph (Q687148) (← links)
- On a criterion for matchability in hypergraphs (Q687713) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Homology of the line graph and of related graph-valued functions (Q910416) (← links)
- A characterization of interval catch digraphs (Q1118608) (← links)
- Unit disk graphs (Q1174134) (← links)
- On grid intersection graphs (Q1174140) (← links)
- The intersection graph of random sets (Q1174144) (← links)
- Intersection properties of graphs (Q1175421) (← links)
- Metric characterization of parity graphs (Q1182856) (← links)
- On neighbourhood line graphs (Q1182866) (← links)
- A-cordial graphs (Q1182892) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- On inverse problems for the cycle graph operator (Q1196567) (← links)
- On factors of uniform intersection graphs (Q1196583) (← links)
- Convergence of iterated clique graphs (Q1197055) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- Neighborhood unions and a generalization of Dirac's theorem (Q1199474) (← links)
- A new characterization of proper interval graphs (Q1199478) (← links)
- Digital Jordan curves---a graph-theoretical approach to a topological theorem (Q1205565) (← links)
- Hamilton cycles in regular 3-connected graphs (Q1208363) (← links)
- (Q1261171) (redirect page) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Intersection multigraphs of uniform hypergraphs (Q1272535) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- Generalized octahedra and cliques in intersection graphs of uniform hypergraphs (Q1304822) (← links)
- The dynamics of the line and path graph operators (Q1313351) (← links)
- A generalization of a result of Bauer and Schmeichel (Q1313355) (← links)
- In-tournament digraphs (Q1322037) (← links)
- Solving a conjecture of Sedlacek: Maximal edge sets in the 3-uniform sumset hypergraphs (Q1322279) (← links)
- Fulkerson's conjecture and circuit covers (Q1328394) (← links)
- Subgraphs, closures and hamiltonicity (Q1329802) (← links)
- Algorithms for interval catch digraphs (Q1329814) (← links)
- Remarks on Hamiltonian properties of powers of digraphs (Q1329819) (← links)
- Iterated \(k\)-line graphs (Q1334947) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Lower bounds of tower type for Szemerédi's uniformity lemma (Q1355452) (← links)
- Radius versus diameter in cocomparability and intersection graphs (Q1356529) (← links)
- The recognition problem for line bigraphs (Q1398267) (← links)
- On regular factors in regular graphs with small radius (Q1422147) (← links)
- Eccentricity-approximating trees in chordal graphs (Q1567628) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- Recognizing random intersection graphs (Q1587611) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors (Q1876686) (← links)
- Graphs with not all possible path-kernels (Q1877673) (← links)
