The following pages link to Michael Hager (Q593214):
Displaying 47 items.
- Representations of lattice terms by means of graphs (Q1270649) (← links)
- The Hamiltonian property of consecutive-\(d\) digraphs (Q1310230) (← links)
- Mortality of iterated Gallai graphs (Q1321643) (← links)
- Exact graphs (Q1341242) (← links)
- A class of graphs each tolerance graph of which is a bounded one (Q1341250) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← links)
- Path-connectivity in local tournaments (Q1356475) (← links)
- Path partition number in tough graphs (Q1356718) (← links)
- Characterization of \(c\)-circulant digraphs of degree two which are circulant (Q1356734) (← links)
- On the line graphs of the complete \(r\)-partite graphs (Q1363708) (← links)
- The Hamiltonian property of the consecutive-3 digraphs (Q1368420) (← links)
- Sources and sinks in comparability graphs (Q1368667) (← links)
- Super line-connectivity of consecutive-\(d\) digraphs (Q1382814) (← links)
- The connectivity of the SEE-graph and AEE-graph for the connected spanning \(k\)-edge subgraphs of a graph (Q1382830) (← links)
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. (Q1405103) (← links)
- Short proof of Menger's theorem (Q1567687) (← links)
- Jump-number of means on graphs (Q1582483) (← links)
- Curve reconstruction, the Traveling Salesman Problem, and Menger's theorem on length (Q1591051) (← links)
- On pebbling threshold functions for graph sequences (Q1598791) (← links)
- A note on graph pebbling (Q1606023) (← links)
- Maximum order of trees and bipartite graphs with a given rank (Q1759390) (← links)
- The \(k\)-restricted edge-connectivity of a product of graphs (Q1759863) (← links)
- Cuts leaving components of given minimum order (Q1773356) (← links)
- On the hardness of computing maximum self-reduction sequences (Q1841907) (← links)
- Pebbling and Graham's conjecture (Q1841936) (← links)
- How many steps are necessary to separate a bigraph? (Q1850581) (← links)
- Thresholds for random distributions on graph sequences with applications to pebbling (Q1861202) (← links)
- A note on tolerance graph recognition (Q1887065) (← links)
- The global set-domination number of a graph (Q1891543) (← links)
- \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory (Q1897444) (← links)
- On strongly asymmetric graphs (Q1901054) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- Möbius inversion on a poset of a graph and its acyclic subgraphs (Q1917315) (← links)
- On infinite bridged graphs and strongly dismantlable graphs (Q1969784) (← links)
- Edge isoperimetric inequalities for product graphs (Q1970722) (← links)
- Degree complete graphs (Q2368928) (← links)
- Score sets in oriented \(k\)-partite graphs (Q2370389) (← links)
- On the non-existence of pair covering designs with at least as many points as blocks (Q2428629) (← links)
- On the existence of \((k, l)\)-kernels in digraphs with a given circumference (Q2443409) (← links)
- Strongly 4-path-connectivity in almost regular multipartite tournaments (Q2463909) (← links)
- On the connectivity of close to regular multipartite tournaments (Q2492221) (← links)
- On restricted arc-connectivity of regular digraphs (Q2493638) (← links)
- Highly linked graphs (Q2563507) (← links)
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (Q2568484) (← links)
- (Q3329505) (← links)
- A Mengerian theorem for paths of length at least three (Q3743329) (← links)
- (Q3931430) (← links)
