The following pages link to Michael Hager (Q593214):
Displaying 50 items.
- An inequality for Tutte polynomials (Q532122) (← links)
- On Halin-lattices in graphs (Q595689) (← links)
- No finite-infinite antichain duality in the homomorphism poset of directed graphs (Q603883) (← links)
- Asymptotic connectivity of hyperbolic planar graphs (Q607003) (← links)
- On a conjecture concerning the Petersen graph (Q625382) (← links)
- Large non-planar graphs and an application to crossing-critical graphs (Q631645) (← links)
- Characteristic polynomials of skew-adjacency matrices of oriented graphs (Q640406) (← links)
- The structure of hereditary properties and 2-coloured multigraphs (Q653987) (← links)
- Some constructions of highly arc-transitive digraphs (Q653999) (← links)
- (Q704287) (redirect page) (← links)
- Diameter, short paths and superconnectivity in digraphs (Q704288) (← links)
- (Q790838) (redirect page) (← links)
- A sufficient condition for a graph to be weakly k-linked (Q790839) (← links)
- Graph decompositions without isolates (Q790844) (← links)
- A variation of Menger's theorem for long paths (Q796549) (← links)
- Every finite distributive lattice is a set of stable matchings (Q798345) (← links)
- Paths and edge-connectivity in graphs (Q799691) (← links)
- Note on a pursuit game played on graphs (Q799702) (← links)
- Every 4k-edge-connected graph is weakly 3k-linked (Q920108) (← links)
- Particular cycles of a binary de Bruijn digraph (Q966168) (← links)
- Pancyclicity of Hamiltonian and highly connected graphs (Q974472) (← links)
- Galaxy cutsets in graphs (Q975761) (← links)
- Pendant tree-connectivity (Q1059087) (← links)
- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) (Q1066160) (← links)
- On maps related to Halin separation lattices (Q1068109) (← links)
- On score sets for tournaments (Q1069952) (← links)
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen (Q1074599) (← links)
- Neighbour-connectivity in regular graphs (Q1074600) (← links)
- On k-leaf-connected graphs (Q1080438) (← links)
- Path-connectivity in graphs (Q1085178) (← links)
- Contractible edges in 3-connected graphs (Q1087557) (← links)
- Connected graphs containing a given connected graph as a unique greatest common subgraph (Q1087564) (← links)
- On the \(\ell\)-connectivity of a graph (Q1094432) (← links)
- Menger's theorem for countable graphs (Q1094433) (← links)
- The connected cutset connectivity of a graph (Q1101465) (← links)
- Removable edges in cyclically 4-edge-connected cubic graphs (Q1101466) (← links)
- The chromatic connectivity of graphs (Q1110536) (← links)
- Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) (Q1110537) (← links)
- On van der Waerden's theorem on arithmetic progressions (Q1160181) (← links)
- On primitive sets in graphs (Q1162522) (← links)
- The discipline number of a graph (Q1174136) (← links)
- A new proof of the theorem by Fleischner (Q1179471) (← links)
- A mixed version of Menger's theorem (Q1180411) (← links)
- Uniform cyclic edge connectivity in cubic graphs (Q1180413) (← links)
- On minimal neighbourhood-connected graphs (Q1182928) (← links)
- Connectivity of distance graphs (Q1196753) (← links)
- Connectivity of consecutive-\(d\) digraphs (Q1199422) (← links)
- The connectivity of hierarchical Cayley digraphs (Q1199430) (← links)
- Cycle-connected graphs (Q1201258) (← links)
- On Reid conjecture of score sets for tournaments (Q1262874) (← links)
