Found: 27
Select item for more details and to access through your institution.
Forcing generalised quasirandom graphs efficiently.
- Published in:
- Combinatorics, Probability & Computing, 2024, v. 33, n. 1, p. 16, doi. 10.1017/S0963548323000263
- By:
- Publication type:
- Article
Toward characterizing locally common graphs.
- Published in:
- Random Structures & Algorithms, 2023, v. 62, n. 1, p. 181, doi. 10.1002/rsa.21099
- By:
- Publication type:
- Article
Expression of Genes Involved in ABA and Auxin Metabolism and LEA Gene during Embryogenesis in Hemp.
- Published in:
- Plants (2223-7747), 2022, v. 11, n. 21, p. 2995, doi. 10.3390/plants11212995
- By:
- Publication type:
- Article
Quasirandom Latin squares.
- Published in:
- Random Structures & Algorithms, 2022, v. 61, n. 2, p. 298, doi. 10.1002/rsa.21060
- By:
- Publication type:
- Article
Characterization of quasirandom permutations by a pattern sum.
- Published in:
- Random Structures & Algorithms, 2020, v. 57, n. 4, p. 920, doi. 10.1002/rsa.20956
- By:
- Publication type:
- Article
Permutations with fixed pattern densities.
- Published in:
- Random Structures & Algorithms, 2020, v. 56, n. 1, p. 220, doi. 10.1002/rsa.20882
- By:
- Publication type:
- Article
Compactness and finite forcibility of graphons.
- Published in:
- Journal of the European Mathematical Society (EMS Publishing), 2019, v. 21, n. 10, p. 3199, doi. 10.4171/JEMS/901
- By:
- Publication type:
- Article
Decomposing Graphs into Edges and Triangles.
- Published in:
- Combinatorics, Probability & Computing, 2019, v. 28, n. 3, p. 465, doi. 10.1017/S0963548318000421
- By:
- Publication type:
- Article
Optimal‐size clique transversals in chordal graphs.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 4, p. 479, doi. 10.1002/jgt.22362
- By:
- Publication type:
- Article
First order limits of sparse graphs: Plane trees and path-width.
- Published in:
- Random Structures & Algorithms, 2017, v. 50, n. 4, p. 612, doi. 10.1002/rsa.20676
- By:
- Publication type:
- Article
First-Order Convergence and Roots.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 2, p. 213, doi. 10.1017/S0963548315000048
- By:
- Publication type:
- Article
FO MODEL CHECKING OF INTERVAL GRAPHS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2015, v. 11, n. 4, p. 1, doi. 10.2168/LMCS-11(4:11)2015
- By:
- Publication type:
- Article
Extensions of Fractional Precolorings Show Discontinuous Behavior.
- Published in:
- Journal of Graph Theory, 2014, v. 77, n. 4, p. 299, doi. 10.1002/jgt.21787
- By:
- Publication type:
- Article
A New Bound for the 2/3 Conjecture.
- Published in:
- Combinatorics, Probability & Computing, 2013, v. 22, n. 3, p. 384, doi. 10.1017/S0963548312000612
- By:
- Publication type:
- Article
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.
- Published in:
- Random Structures & Algorithms, 2012, v. 41, n. 4, p. 506, doi. 10.1002/rsa.20471
- By:
- Publication type:
- Article
Non-Three-Colourable Common Graphs Exist.
- Published in:
- Combinatorics, Probability & Computing, 2012, v. 21, n. 5, p. 734, doi. 10.1017/S0963548312000107
- By:
- Publication type:
- Article
A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points.
- Published in:
- Discrete & Computational Geometry, 2012, v. 48, n. 2, p. 487, doi. 10.1007/s00454-012-9419-3
- By:
- Publication type:
- Article
Coloring Eulerian Triangulations of the Klein Bottle.
- Published in:
- Graphs & Combinatorics, 2012, v. 28, n. 4, p. 499, doi. 10.1007/s00373-011-1063-9
- By:
- Publication type:
- Article
Domination number of cubic graphs with large girth.
- Published in:
- Journal of Graph Theory, 2012, v. 69, n. 2, p. 131, doi. 10.1002/jgt.20568
- By:
- Publication type:
- Article
Fullerene graphs have exponentially many perfect matchings.
- Published in:
- Journal of Mathematical Chemistry, 2009, v. 46, n. 2, p. 443, doi. 10.1007/s10910-008-9471-7
- By:
- Publication type:
- Article
Polynomial-Size Binary Decision Diagrams for the Exactly Half- d-Hyperclique Problem Reading Each Input Bit Twice.
- Published in:
- Theory of Computing Systems, 2009, v. 45, n. 1, p. 27, doi. 10.1007/s00224-007-9067-9
- By:
- Publication type:
- Article
Long cycles in fullerene graphs.
- Published in:
- Journal of Mathematical Chemistry, 2009, v. 45, n. 4, p. 1021, doi. 10.1007/s10910-008-9390-7
- By:
- Publication type:
- Article
Tough spiders.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 1, p. 23
- By:
- Publication type:
- Article
Closure for the property of having a hamiltonian prism.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 3, p. 209
- By:
- Publication type:
- Article
Probabilistic strategies for the partition and plurality problems.
- Published in:
- Random Structures & Algorithms, 2007, v. 30, n. 1/2, p. 63, doi. 10.1002/rsa.20148
- By:
- Publication type:
- Article
The last excluded case of Dirac's map‐color theorem for choosability.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 4, p. 319
- By:
- Publication type:
- Article
Pancyclicity of Strong Products of Graphs.
- Published in:
- Graphs & Combinatorics, 2004, v. 20, n. 1, p. 91, doi. 10.1007/s00373-003-0545-9
- By:
- Publication type:
- Article