The following pages link to Linda Lesniak (Q267204):
Displaying 50 items.
- The vertex size-Ramsey number (Q267205) (← links)
- Ralph Faudree (1938--2015) (Q279190) (← links)
- (Q587983) (redirect page) (← links)
- On unavoidable graphs (Q595677) (← links)
- (Q686258) (redirect page) (← links)
- \(\phi\)-threshold and \(\phi\)-tolerance chain graphs (Q686259) (← links)
- Generalizing pancyclic and \(k\)-ordered graphs (Q704843) (← links)
- Soccer balls, golf balls, and the Euler identity (Q721095) (← links)
- Regular graphs and edge chromatic number (Q790826) (← links)
- A lower bound on cochromatic number for line graphs of a kind of graphs (Q854573) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- On \(s\)-Hamiltonian-connected line graphs (Q941364) (← links)
- Conditional matching preclusion sets (Q1006754) (← links)
- On the circumference of a graph and its complement (Q1045133) (← links)
- Bipartite regulation numbers (Q1088677) (← links)
- Neighborhood conditions and edge-disjoint perfect matchings (Q1179275) (← links)
- Further results on snakes in powers of complete graphs (Q1182573) (← links)
- Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths (Q1196378) (← links)
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs (Q1196745) (← links)
- On total covers of graphs (Q1198645) (← links)
- Generalized degrees and Menger path systems (Q1199423) (← links)
- Neighborhood unions and a generalization of Dirac's theorem (Q1199474) (← links)
- On n-hamiltonian line graphs (Q1217716) (← links)
- On n-Hamiltonian graphs (Q1221119) (← links)
- Eccentric sequences in graphs (Q1240256) (← links)
- A note on stable graphs (Q1242176) (← links)
- Cycles of length 0 modulo 4 in graphs (Q1309447) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Supereulerian graphs, independent sets, and degree-sum conditions (Q1377709) (← links)
- Results on the edge-connectivity of graphs (Q1393410) (← links)
- Advances on the Hamiltonian problem -- a survey (Q1396651) (← links)
- 0-dual closures for several classes of graphs (Q1411106) (← links)
- (Q1598842) (redirect page) (← links)
- Characterizing forbidden clawless triples implying Hamiltonian graphs (Q1598843) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Strong inapproximability results on balanced rainbow-colorable hypergraphs (Q1715058) (← links)
- Constructing dominating sets in circulant graphs (Q1745909) (← links)
- Chorded pancyclicity in \(k\)-partite graphs (Q1756119) (← links)
- Connected factors in graphs -- a survey (Q1777234) (← links)
- A generalization of Dirac's theorem for \(K(1,3)\)-free graphs (Q1813059) (← links)
- A note on ascending subgraph decompositions of complete multipartite graphs (Q1841928) (← links)
- On generalized Ramsey numbers (Q1850077) (← links)
- Toughness, degrees and 2-factors (Q1887644) (← links)
- Degree conditions and cycle extendability (Q1894763) (← links)
- Threshold graphs and related topics (Q1899209) (← links)
- Hamiltonicity in balanced \(k\)-partite graphs (Q1900517) (← links)
- Partitioning permutations into increasing and decreasing subsequences (Q1906146) (← links)
- Graph spectra (Q1916101) (← links)
- The Chvátal-Erdös condition for cycles in triangle-free graphs (Q1917498) (← links)
- On the maximum number of independent cycles in a bipartite graph (Q1924141) (← links)
