The following pages link to Felix Joos (Q251504):
Displaying 50 items.
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- A characterization of substar graphs (Q401150) (← links)
- Random subgraphs in Cartesian powers of regular graphs (Q426814) (← links)
- Forests and trees among Gallai graphs (Q472964) (← links)
- Induced cycles in graphs (Q503635) (← links)
- (Q590228) (redirect page) (← links)
- How to determine if a random graph with a fixed degree sequence has a giant component (Q681521) (← links)
- The edge-Erdős-Pósa property (Q822640) (← links)
- On kissing numbers and spherical codes in high dimensions (Q1669035) (← links)
- Paths and cycles in random subgraphs of graphs with large minimum degree (Q1753122) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Decomposing hypergraphs into cycle factors (Q2101168) (← links)
- Badly-covered graphs (Q2255048) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- Maximum induced matchings close to maximum matchings (Q2348267) (← links)
- Long cycles have the Edge-Erdős-Pósa property (Q2416508) (← links)
- A unified Erdős-Pósa theorem for constrained cycles (Q2416515) (← links)
- Independence and matching number in graphs with maximum degree 4 (Q2439118) (← links)
- Equality of distance packing numbers (Q2515579) (← links)
- A note on longest paths in circular arc graphs (Q2516667) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Induced Matchings in Graphs of Bounded Maximum Degree (Q2826215) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- Ramsey Results for Cycle Spectra (Q2853338) (← links)
- A Characterization of Mixed Unit Interval Graphs (Q2945201) (← links)
- On a rainbow version of Dirac's theorem (Q3300090) (← links)
- Random Subgraphs in Sparse Graphs (Q3455246) (← links)
- Critical percolation on random regular graphs (Q4563646) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS (Q4610443) (← links)
- Long cycles through prescribed vertices have the Erdős‐Pósa property (Q4638627) (← links)
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443) (← links)
- Induced Matchings in Subcubic Graphs (Q4979850) (← links)
- Erdös--Pósa Property for Labeled Minors: 2-Connected Minors (Q4990390) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Percolation on Random Graphs with a Fixed Degree Sequence (Q5020830) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- Spanning trees in randomly perturbed graphs (Q5113937) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (Q5237911) (← links)
- Relating ordinary and total domination in cubic graphs of large girth (Q5419942) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
