The following pages link to Michael Ferrara (Q247196):
Displaying 50 items.
- I,F-partitions of sparse graphs (Q298327) (← links)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- Saturation numbers for families of Ramsey-minimal graphs (Q446009) (← links)
- Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs (Q456311) (← links)
- (Q524189) (redirect page) (← links)
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
- Pan-\(H\)-linked graphs (Q604671) (← links)
- Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum (Q604675) (← links)
- List-distinguishing colorings of graphs (Q640414) (← links)
- Characterizing degree-sum maximal nonhamiltonian bipartite graphs (Q658075) (← links)
- An iterative approach to graph irregularity strength (Q708356) (← links)
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- The game of \(\mathcal F\)-saturator (Q968127) (← links)
- Graphic sequences with a realization containing a union of cliques (Q995771) (← links)
- Graphic sequences with a realization containing a complete multipartite subgraph (Q998452) (← links)
- Disjoint Hamiltonian cycles in bipartite graphs (Q1043548) (← links)
- Irregularity strength of digraphs (Q1045122) (← links)
- tK\(_p\)-saturated graphs of minimum size (Q1045128) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- On the approximate shape of degree sequences that are not potentially \(H\)-graphic (Q1713791) (← links)
- Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs (Q1937559) (← links)
- Conditions for families of disjoint \(k\)-connected subgraphs in a graph (Q1942666) (← links)
- List distinguishing parameters of trees (Q1946232) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- Navigating between packings of graphic sequences (Q2026343) (← links)
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs (Q2043390) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- Ramsey-minimal saturation numbers for matchings (Q2436829) (← links)
- On 2-factors with a bounded number of odd components (Q2439124) (← links)
- Generalizing \(D\)-graphs (Q2462386) (← links)
- On \(H\)-linked graphs (Q2502035) (← links)
- (Q2866611) (← links)
- Packing of graphic n-tuples (Q2888877) (← links)
- New Ore-Type Conditions for H-Linked Graphs (Q2911053) (← links)
- Degree Conditions for Spanning Brooms (Q2930040) (← links)
- (Q3001202) (← links)
- (Q3070201) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)
- An Erdős-Stone Type Conjecture for Graphic Sequences (Q3439575) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- The structure and existence of 2-factors in iterated line graphs (Q3504802) (← links)
- Potentially H-bigraphic sequences (Q3560784) (← links)
- (Q3636211) (← links)
- (Q4405792) (← links)
- Colored Saturation Parameters for Rainbow Subgraphs (Q4596322) (← links)
- Saturation numbers for families of graph subdivisions (Q4650190) (← links)
