The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- Perfectly contractile graphs (Q803147) (← links)
- A characterization of the words occurring as factors in a minimum number of words (Q818148) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- The Ramsey numbers of large cycles versus wheels (Q856890) (← links)
- Euler-Mahonian polynomials for \(C_{a}\wr S_{n}\) (Q863311) (← links)
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\) (Q864145) (← links)
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346) (← links)
- Decomposing Berge graphs containing no proper wheel, long prism or their complements (Q879162) (← links)
- Almost all digraphs have a kernel (Q915737) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs (Q949794) (← links)
- The basis number of the Cartesian product of stars and wheels with different ladders (Q950323) (← links)
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams (Q950332) (← links)
- Regressive functions on pairs (Q966137) (← links)
- Series-parallel chromatic hypergraphs (Q968129) (← links)
- Generalized low-voltage circuit techniques for very high-speed time-interleaved analog-to-digital converters (Q983254) (← links)
- Boolean sets and most general solutions of Boolean equations (Q985071) (← links)
- On the number of words containing the factor \((aba)^k\) (Q997077) (← links)
- On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2 (Q1003694) (← links)
- On 3-restricted edge connectivity of undirected binary Kautz graphs (Q1011693) (← links)
- Properties of connected graphs having minimum degree distance (Q1043622) (← links)
- On the chromaticity of multi-bridge hypergraphs (Q1043804) (← links)
- Chromatic number of finite and infinite graphs and hypergraphs (Q1059084) (← links)
- On color critical graphs (Q1059085) (← links)
- (Q1061130) (redirect page) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Heawood's empire problem (Q1062996) (← links)
- Triangles in a complete chromatic graph with three colors (Q1068844) (← links)
- Graph coloring and monotone functions on posets (Q1069950) (← links)
- The chromatic index of simple hypergraphs (Q1073804) (← links)
- On the number of paths and cycles for almost all graphs and digraphs (Q1076688) (← links)
- Hypertrees and Bonferroni inequalities (Q1077437) (← links)
- Uniquely cocolourable graphs (Q1079577) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Hamiltonian dicycles avoiding prescribed arcs in tournaments (Q1090684) (← links)
- Hamilton cycles in directed Euler tour graphs (Q1095154) (← links)
- Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons (Q1095936) (← links)
- Graphical Eulerian numbers and chromatic generating functions (Q1101460) (← links)
- On a class of Hamiltonian polytopes (Q1109049) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
- Coloured graphs representing manifolds and universal maps (Q1115449) (← links)
- Consistency results on infinite graphs (Q1117946) (← links)
- A new upper bound for the list chromatic number (Q1121274) (← links)
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- On words containing all short subwords (Q1128671) (← links)
- Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets (Q1158173) (← links)
- Boolean distance for graphs (Q1160140) (← links)
- (Q1170203) (redirect page) (← links)
