The following pages link to G. Wegner (Q703682):
Displaying 50 items.
- (Q587973) (redirect page) (← links)
- On the planarity of Hanoi graphs (Q699008) (← links)
- On a hypercube coloring problem (Q703683) (← links)
- A geometric property of the boundary of symmetric convex bodies and convexity of flotation surfaces (Q807977) (← links)
- Circular list colorings of some graphs (Q815980) (← links)
- \(K_{5}\)-free bound for the class of planar graphs (Q852707) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions (Q1062277) (← links)
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions (Q1080184) (← links)
- Polytopal and nonpolytopal spheres. An algorithmic approach (Q1100441) (← links)
- Arrangements of lines with a minimum number of triangles are simple (Q1100442) (← links)
- Chromatic polynomials of generalized trees (Q1112057) (← links)
- A construction of k-graceful graphs from complete bipartite graphs (Q1119954) (← links)
- Separating convex sets in the plane (Q1184162) (← links)
- Relative Newton numbers (Q1207661) (← links)
- Distributions on bicoloured binary trees arising from the principle of parsimony (Q1208487) (← links)
- Hamiltonian circuits in simple 3-polytopes with up to 26 vertices (Q1215510) (← links)
- d-collapsing and nerves of families of convex sets (Q1218654) (← links)
- Total domatic number of a graph. I (Q1265335) (← links)
- On an extremal problem for colored trees (Q1279875) (← links)
- Extremal problems for colored trees and Davenport-Schinzel sequences (Q1292853) (← links)
- Some properties of 3-domination-critical graphs (Q1301830) (← links)
- Local and global clique numbers (Q1328379) (← links)
- Symmetrization theorem of full Steiner trees (Q1328395) (← links)
- Recognizing the \(P_ 4\)-structures of a tree (Q1343225) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Edge maximal non-bipartite graphs without odd cycles of prescribed lengths (Q1348667) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- Simple, reducible Venn diagrams on five curves and Hamiltonian cycles (Q1379516) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Pathwidth of planar and line graphs (Q1396654) (← links)
- On the upper and lower chromatic numbers of BSQSs(16) (Q1593852) (← links)
- Distance in graphs -- taking the long view (Q1772194) (← links)
- Determining starshaped sets and unions of starshaped sets by their sections (Q1821353) (← links)
- Geometrical embeddings of graphs (Q1825202) (← links)
- Wagner's conjecture and the graph-minor project (Q1861446) (← links)
- Circular cylinders through four or five points in space (Q1864130) (← links)
- On the \(p\)-factor-criticality of the Klein bottle (Q1886362) (← links)
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs (Q1906843) (← links)
- \(T\)-theory: An overview (Q1911838) (← links)
- Partition of three-dimensional sets into five parts of smaller diameter (Q1957037) (← links)
- Complexity aspects of the Helly property: graphs and hypergraphs (Q1960293) (← links)
- Characterization of the graphs with boxicity \(\leq 2\) (Q2277492) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- Hypergraph extension of the Alon-Tarsi list coloring theorem (Q2387187) (← links)
- The principal numbers of K. Saito for the types \(A_{l}, D_{l}\) and \(E_{l}\) (Q2455588) (← links)
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs (Q2469983) (← links)
- On the spectral radius of graphs with a given domination number (Q2479498) (← links)
- Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner (Q2529908) (← links)
- Ein ebenes Transversalenproblem (Q2559064) (← links)
