The following pages link to Andreas Huck (Q175589):
Displaying 35 items.
- (Q1126195) (redirect page) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- A sufficient condition for graphs to be weakly \(k\)-linked (Q1180674) (← links)
- Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (Q1199122) (← links)
- Boolean functions with low average sensitivity depend on few coordinates (Q1280280) (← links)
- Independent trees in planar graphs (Q1288514) (← links)
- Independent branchings in acyclic digraphs (Q1297456) (← links)
- Independent trees and branchings in planar multigraphs (Q1299999) (← links)
- Independent trees in graphs (Q1323489) (← links)
- Bridged graphs are cop-win graphs: An algorithmic proof (Q1354123) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- On the complete chromatic number of Halin graphs (Q1363017) (← links)
- Cyclic and cliquewise connectedness of line graphs (Q1363680) (← links)
- A new method for proving chromatic uniqueness of graphs (Q1363698) (← links)
- Color-critical graphs and hypergraphs with few edges and no short cycles (Q1379816) (← links)
- Tutte cycles in circuit graphs (Q1379828) (← links)
- The independence number of the strong product of odd cycles (Q1379990) (← links)
- Perfect matchings in balanced hypergraphs---a combinatorial approach (Q1872893) (← links)
- Five cycle double covers of some cubic graphs (Q1892855) (← links)
- Excluding a long double path minor (Q1907107) (← links)
- A nonhamiltonian five-regular multitriangular polyhedral graph (Q1916128) (← links)
- On equitable coloring of bipartite graphs (Q1916388) (← links)
- Nowhere-zero 4-flows and cycle double covers (Q1918555) (← links)
- On the chromatic uniqueness of the graph \(W(n,n-2,k)\) (Q1923777) (← links)
- Graphs where every maximal path is maximum (Q1924151) (← links)
- Reducible configurations for the cycle double cover conjecture (Q1962036) (← links)
- (Q3204496) (← links)
- (Q3999955) (← links)
- Edge-disjoint paths and cycles inn-edge-connected graphs (Q4016023) (← links)
- (Q4218149) (← links)
- (Q4273850) (← links)
- Large <i>k</i>‐preserving sets in infinite graphs (Q4297826) (← links)
- Forbidden subgraphs that imply hamiltonian‐connectedness* (Q4539874) (← links)
- Disproof of a conjecture about independent branchings in <i>k</i>‐connected directed graphs (Q4852408) (← links)
- (Q4944739) (← links)
