The following pages link to Edward F. Schmeichel (Q290246):
Displaying 50 items.
- Orienting graphs to optimize reachability (Q290248) (← links)
- (Q343707) (redirect page) (← links)
- Vertex arboricity and vertex degrees (Q343708) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Best monotone degree conditions for binding number (Q641165) (← links)
- (Q749552) (redirect page) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Parallel algorithms for gossiping by mail (Q911271) (← links)
- Hamiltonian degree conditions which imply a graph is pancyclic (Q912127) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- A cycle structure theorem for Hamiltonian graphs (Q1085183) (← links)
- The number of triangles in a triangulation of a set of points in the plane (Q1149450) (← links)
- Bounds on the number of cycles of length three in a planar graph (Q1163566) (← links)
- On the maximum number of independent edges in cubic graphs (Q1171579) (← links)
- The basis number of the \(n\)-cube (Q1172653) (← links)
- On felicitous graphs (Q1182895) (← links)
- Connectivity, genus, and the number of components in vertex-deleted subgraphs (Q1233441) (← links)
- New flip-flop constructions for hypohamiltonian graphs (Q1242175) (← links)
- The basis number of a graph (Q1249182) (← links)
- (Q1313819) (redirect page) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Pancyclic graphs and a conjecture of Bondy and Chvatal (Q1394236) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor (Q1684941) (← links)
- Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
- Toughness and triangle-free graphs (Q1907099) (← links)
- Star arboricity of graphs (Q1910571) (← links)
- Gossiping with multiple sends and receives (Q1917243) (← links)
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)
- A generalization of a theorem of Nash-Williams (Q2102754) (← links)
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435) (← links)
- Toughness and binding number (Q2448921) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- (Q2713622) (← links)
- (Q2713657) (← links)
- Binding Number, Minimum Degree, and Cycle Structure in Graphs (Q2911065) (← links)
- (Q2971216) (← links)
- Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph (Q3057109) (← links)
- (Q3070257) (← links)
- (Q3139757) (← links)
- On locating path- or tree-shaped facilities on networks (Q3141111) (← links)
- Improved bounds for the chromatic number of a graph (Q3159378) (← links)
- An adaptive algorithm for system level diagnosis (Q3220497) (← links)
- (Q3344225) (← links)
