The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- (Q5750906) (← links)
- Chromatic polynomials of hypergraphs (Q5890237) (← links)
- Acyclic colorings of planar graphs (Q5905418) (← links)
- Beyond Göllnitz' theorem. I: A bijective approach (Q5918943) (← links)
- Principal specializations of Schubert polynomials in classical types (Q5925603) (← links)
- Colouring arcwise connected sets in the plane. I (Q5935603) (← links)
- Construction of sparse graphs with prescribed circular colorings (Q5936037) (← links)
- Achromatic number of \(K_5\times K_n\) for large \(n\) (Q5936062) (← links)
- Chromatic equivalence classes of certain cycles with edges (Q5937461) (← links)
- Aspects of edge list-colourings (Q5937593) (← links)
- Chromatic polynomials and their zeros and asymptotic limits for families of graphs (Q5937607) (← links)
- On the number of graphs and \(h\)-hypergraphs with bounded diameter (Q5937940) (← links)
- Almost distance-hereditary graphs (Q5957743) (← links)
- Fixing numbers for matroids (Q5964981) (← links)
- Dual Ramsey theorem for trees (Q6057486) (← links)
- Sunflowers in set systems of bounded dimension (Q6057492) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)
- Kempe equivalent list edge-colorings of planar graphs (Q6091809) (← links)
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices (Q6091814) (← links)
- Parabolic Tamari lattices in linear type \(B\) (Q6103833) (← links)
- On \((t, r)\) broadcast domination of certain grid graphs (Q6148305) (← links)
- Extremal quasi-unicyclic graphs with respect to vertex-degree function index (Q6164649) (← links)
- A lift of West's stack-sorting map to partition diagrams (Q6165151) (← links)
- Zero-divisor super-\(\lambda\) graphs (Q6188413) (← links)
- Count and cofactor matroids of highly connected graphs (Q6196151) (← links)
- Extended commonality of paths and cycles via Schur convexity (Q6196155) (← links)
- Restricted problems in extremal combinatorics (Q6198640) (← links)
- The cardinality of Kiselman's semigroups grows double-exponentially (Q6203873) (← links)
- Eigenvalue multiplicity of a graph in terms of the number of external vertices (Q6541324) (← links)
- There is a unique crossing-minimal rectilinear drawing of \(K_{18}\) (Q6545086) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
- A characterization of graphs whose small powers of their edge ideals have a linear free resolution (Q6548020) (← links)
- Proof of some Littlewood identities conjectured by Lee, Rains and Warnaar (Q6557370) (← links)
- Graphs with all holes the same length (Q6564607) (← links)
- Dirac-type theorems for long Berge cycles in hypergraphs (Q6564608) (← links)
- Chvátal-Erdős condition for pancyclicity (Q6601490) (← links)
- The packing number of cubic graphs (Q6602335) (← links)
- On the number of \(A\)-transversals in hypergraphs (Q6607826) (← links)
- A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs (Q6607841) (← links)
- Solution to a problem of Grünbaum on the edge density of 4-critical planar graphs (Q6607843) (← links)
- A note on the singularity probability of random directed \(d\)-regular graphs (Q6612308) (← links)
- Biclique immersions in graphs with independence number 2 (Q6612311) (← links)
- A note on approximate Hadamard matrices (Q6618629) (← links)
- Generalized chromatic functions (Q6623552) (← links)
- The Turán density of tight cycles in three-uniform hypergraphs (Q6623562) (← links)
- Maximum bond incident degree indices of trees with given independence number (Q6630957) (← links)
- Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs (Q6640934) (← links)
- On extremal problems on multigraphs (Q6640956) (← links)
- Minimal abundant packings and choosability with separation (Q6651912) (← links)
- Cells of fixed height in Catalan words and restricted growth functions (Q6665421) (← links)
