The following pages link to Edward F. Schmeichel (Q290246):
Displayed 50 items.
- (Q3568730) (← links)
- Tutte sets in graphs I: Maximal tutte sets and D-graphs (Q3594956) (← links)
- (Q3615980) (← links)
- (Q3680866) (← links)
- (Q3699724) (← links)
- Chromatic factorizations of a graph (Q3818332) (← links)
- (Q3820627) (← links)
- (Q3829577) (← links)
- (Q3831040) (← links)
- On the number of hamiltonian cycles in a maximal planar graph (Q3855220) (← links)
- (Q3942982) (← links)
- Bipartite graphs with cycles of all even lengths (Q3967560) (← links)
- (Q3972137) (← links)
- (Q3976600) (← links)
- (Q3976633) (← links)
- (Q3984510) (← links)
- (Q4014299) (← links)
- Sequential information dissemination by packets (Q4018992) (← links)
- The Voronoi Partition of a Network and Its Implications in Location Theory (Q4024312) (← links)
- On Planar Graphical Degree Sequences (Q4137200) (← links)
- (Q4156463) (← links)
- Systematic searches for hypohamiltonian graphs (Q4163258) (← links)
- On the number of cycles of lengthk in a maximal planar graph (Q4177606) (← links)
- (Q4180395) (← links)
- On the connectivity of maximal planar graphs (Q4194992) (← links)
- (Q4206769) (← links)
- On the cost chromatic number of outerplanar, planar, and line graphs (Q4210666) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4290577) (← links)
- Parallel Information Dissemination by Packets (Q4291562) (← links)
- Fitting polygonal functions to a set of points in the plane (Q4303746) (← links)
- Locating replicas of a database on a network (Q4355483) (← links)
- Toughness, minimum degree, and spanning cubic subgraphs (Q4458596) (← links)
- (Q4489197) (← links)
- Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
- A Note on the Vertex Arboricity of a Graph (Q4733881) (← links)
- A note on the edge reconstruction conjecture (Q4770986) (← links)
- Gale's Round-Trip Jeep Problem (Q4845742) (← links)
- Degree‐bounded coloring of graphs: Variations on a theme by brooks (Q4852403) (← links)
- (Q4863407) (← links)
- (Q4871126) (← links)
- (Q4871173) (← links)
- (Q4873682) (← links)
- (Q4873795) (← links)
- 2-factors in triangle-free graphs (Q4879177) (← links)
- Toughness and Vertex Degrees (Q4908831) (← links)
- Locations on time-varying networks (Q4934867) (← links)
- On the necessity of Chvátal’s Hamiltonian degree condition (Q5012357) (← links)
- (Q5405465) (← links)
- (Q5684711) (← links)
- (Q5708558) (← links)