The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes (Q1170204) (← links)
- The harmonious coloring number of a graph (Q1182896) (← links)
- Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
- Cyclic coloring of plane graphs (Q1198649) (← links)
- Ordered \(h\)-hypertrees (Q1199491) (← links)
- Sharpened Bonferroni inequalities (Q1204481) (← links)
- Un algorithme combinatoire pour la résolution des problèmes du type du permanent (Q1215546) (← links)
- Le nombre maximal de colorations d'un graphe Hamiltonien (Q1232417) (← links)
- Some properties of irreducible coverings by cliques of complete multipartite graphs (Q1237990) (← links)
- Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques (Q1251234) (← links)
- Le nombre minimal de colorations d'un hypergraphe k-chromatique (Q1255502) (← links)
- Chromatic coefficients of linear uniform hypergraphs (Q1272479) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- Subdirect decomposition of \(n\)-chromatic graphs (Q1272897) (← links)
- The complexity of upward drawings on spheres (Q1272953) (← links)
- Retractions of finite distance functions onto tree metrics (Q1283796) (← links)
- On defining numbers of vertex colouring of regular graphs (Q1292860) (← links)
- Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes (Q1293635) (← links)
- Colouring proximity graphs in the plane (Q1297436) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- Geodetic metrizations of graphs (Q1297490) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- An extension of Vizing's adjacency lemma of edge chromatic critical graphs (Q1304811) (← links)
- Some classes of strongly perfect graphs (Q1304823) (← links)
- Intersections of randomly embedded sparse graphs are Poisson (Q1307020) (← links)
- A polynomial decomposition of Boolean functions (Q1326027) (← links)
- Bounds on certain multiplications of affine combinations (Q1331901) (← links)
- Maximal TC-clones, graphs and relations (Q1331966) (← links)
- Minimum spanning hypertrees (Q1336639) (← links)
- Hypergraphs and sharpened sieve inequalities (Q1336651) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Bilinear and trilinear partitions of a graph (Q1338161) (← links)
- On the number of 3-edge colorings of cubic graphs (Q1348773) (← links)
- Coloring Eulerian triangulations of the projective plane (Q1349103) (← links)
- On isometric subgraphs of infinite bridged graphs and geodesic convexity (Q1349108) (← links)
- A note on local colorings of graphs (Q1356713) (← links)
- On graphs in which any pair of colour classes but one induces a tree (Q1357722) (← links)
- On the number of trees having \(k\) edges in common with a graph of bounded degrees (Q1357755) (← links)
- General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions (Q1362991) (← links)
- Building counterexamples (Q1363703) (← links)
- Maximum chromatic polynomial of 3-chromatic blocks (Q1366786) (← links)
- A possibly infinite series of surfaces with known 1-chromatic number (Q1367034) (← links)
- List colorings and reducibility (Q1372746) (← links)
- A note on the Beck-Fiala theorem (Q1375063) (← links)
- Chromaticity of chordal graphs (Q1376068) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- On upper bounds for the pseudo-achromatic index (Q1377748) (← links)
- \(T\)-choosability in graphs (Q1383364) (← links)
- Bounds to the chromatic polynomial of a graph (Q1384128) (← links)
