The following pages link to Henning Bruhn (Q289932):
Displaying 50 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Jacobsthal numbers in generalised Petersen graphs (Q322296) (← links)
- The union-closed sets conjecture almost holds for almost all random bipartite graphs (Q326659) (← links)
- Axioms for infinite matroids (Q390757) (← links)
- Matroid and Tutte-connectivity in infinite graphs (Q405204) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Finite connectivity in infinite matroids (Q449217) (← links)
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- Bases and closures under infinite sums (Q551324) (← links)
- Twins of rayless graphs (Q618035) (← links)
- Eulerian edge sets in locally finite graphs (Q653982) (← links)
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits (Q705881) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- The edge-Erdős-Pósa property (Q822640) (← links)
- The journey of the union-closed sets conjecture (Q897265) (← links)
- Periodical states and marching groups in a closed Owari (Q932691) (← links)
- Bicycles and left-right tours in locally finite graphs (Q1003585) (← links)
- MacLane's theorem for arbitrary surfaces (Q1003829) (← links)
- Degree constrained orientations in countable graphs (Q1010857) (← links)
- Maximal determinants of combinatorial matrices (Q1641998) (← links)
- \(K_4\)-expansions have the edge-Erdős-Pósa property (Q1689905) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Infinite matroids in graphs (Q2275379) (← links)
- Long cycles have the Edge-Erdős-Pósa property (Q2416508) (← links)
- Minimal bricks have many vertices of small degree (Q2441634) (← links)
- On end degrees and infinite cycles in locally finite graphs (Q2460629) (← links)
- MacLane's planarity criterion for locally finite graphs (Q2490251) (← links)
- List Edge-Coloring and Total Coloring in Graphs of Low Treewidth (Q2800543) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- Characterising claw-free t-perfect graphs (Q2851509) (← links)
- (Q2934674) (← links)
- Jacobsthal Numbers in Generalized Petersen Graphs (Q2958204) (← links)
- (Q3002790) (← links)
- <i>t</i>-Perfection Is Always Strong for Claw-Free Graphs (Q3008006) (← links)
- Duality in Infinite Graphs (Q3373658) (← links)
- (Q3449055) (← links)
- Duality of Ends (Q3557524) (← links)
- Hamilton Cycles in Planar Locally Finite Graphs (Q3648504) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Long cycles through prescribed vertices have the Erdős‐Pósa property (Q4638627) (← links)
- Generating cycles in graphs with at most one end (Q4805229) (← links)
- Erdös--Pósa Property for Labeled Minors: 2-Connected Minors (Q4990390) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time (Q5419013) (← links)
- The union-closed sets conjecture almost holds for almost all random bipartite graphs (Q5419946) (← links)
- Colouring stability two unit disk graphs (Q5499951) (← links)
- Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs (Q5706480) (← links)
- Menger's theorem for infinite graphs with ends (Q5711777) (← links)
