The following pages link to Matthew P. Yancey (Q317433):
Displayed 28 items.
- (Q298326) (redirect page) (← links)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Describing 3-paths in normal plane maps (Q394206) (← links)
- Ore's conjecture for \(k=4\) and Grötzsch's theorem (Q397076) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Large Rainbow Matchings in Edge-Coloured Graphs (Q2883866) (← links)
- (Q3429476) (← links)
- (Q3429492) (← links)
- Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
- Positively curved graphs (Q5066904) (← links)
- Regular Language Distance and Entropy (Q5111217) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Definitions and properties of entropy and distance for regular languages (Q5210870) (← links)
- Extremal Graphs With a Given Number of Perfect Matchings (Q5325953) (← links)
- Bipartite communities via spectral partitioning (Q5918521) (← links)
- Bipartite communities via spectral partitioning (Q5919643) (← links)
- Large rainbow matchings in large graphs (Q6232331) (← links)
- Bipartite Communities (Q6257391) (← links)
- Bipartite noisy hypercubes have large higher-order Cheeger separation (Q6261210) (← links)
- Negatively Curved Graphs (Q6268032) (← links)
- Three Ways to Count Walks in a Digraph (Q6278288) (← links)
- Probabilistic and Geometrical Applications to Graph Theory (Q6287175) (← links)
- Remarks on the Spectral Approach to Finding Short Paths (Q6353993) (← links)