The following pages link to Roger Entringer (Q207053):
Displaying 50 items.
- Largest induced subgraphs of the n-cube that contain no 4-cycles (Q580365) (← links)
- (Q762494) (redirect page) (← links)
- Disjoint shortest paths in graphs (Q762495) (← links)
- Graphs which are locally a cube (Q788748) (← links)
- Arbres avec un nombre maximum de sommets pendants (Q793746) (← links)
- On maximum critically h-connected graphs (Q801933) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- The number of cutvertices in graphs with given minimum degree (Q912123) (← links)
- Hamiltonicity of tree-like graphs (Q914698) (← links)
- Lifting Hamilton cycles of quotient graphs (Q914699) (← links)
- Edge-Hamiltonian property in regular 2-connected graphs (Q914700) (← links)
- Note on the girth of Ramanujan graphs (Q920107) (← links)
- Some localization theorems on Hamiltonian circuits (Q920111) (← links)
- Locally geodesic cycles in 2-self-centered graphs (Q1073807) (← links)
- Some theorems of uniquely pancyclic graphs (Q1073809) (← links)
- On the intersection of edges of a geometric graph by straight lines (Q1080859) (← links)
- Bipartite regular graphs and shortness parameters (Q1083455) (← links)
- A note on perfect graphs (Q1084108) (← links)
- New classes of perfect graphs (Q1087552) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Computer observations of cycles in cubic graphs (Q1103633) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- Intersection graphs for families of balls in \(R^n\) (Q1112070) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- The subgraph homeomorphism problem for small wheels (Q1117247) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- On circuits through five edges (Q1126199) (← links)
- Minimum graphs with complete k-closure (Q1146691) (← links)
- (Q1166538) (redirect page) (← links)
- Smallest maximally nonhamiltonian graphs (Q1166539) (← links)
- Partitioning regular graphs into equicardinal linear forests (Q1174174) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Threshold functions for local properties of graphs: Triangles (Q1182311) (← links)
- A hyperfactorization of order 8, index 2 (Q1182930) (← links)
- On packing and covering numbers of graphs (Q1185083) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- An inequality for degree sequences (Q1195480) (← links)
- Smallest maximally nonhamiltonian graphs. II (Q1199118) (← links)
- Counting some finite-fold coverings of a graph (Q1199124) (← links)
- Covering the cliques of a graph with vertices (Q1201260) (← links)
- (Q1229224) (redirect page) (← links)
- Errata: Geodetic orientations of complete \(k\)-partite graphs (Q1229227) (← links)
- Spanning cycles of nearly cubic graphs (Q1250225) (← links)
- Gossips and telegraphs (Q1258315) (← links)
- The mod \(p\) rank of incidence matrices for connected uniform hypergraphs (Q1260767) (← links)
- The pessimistic search and the straightening involution for trees (Q1266368) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- Borel chromatic numbers (Q1279827) (← links)
- Augmenting hypergraphs by edges of size two (Q1300052) (← links)
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
