The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- Bounds to the chromatic polynomial of a graph (Q1384128) (← links)
- On multiple coverings of the infinite rectangular grid with balls of constant radius (Q1398253) (← links)
- On a list-coloring problem (Q1398274) (← links)
- Extending partial 3-colourings in a planar graph (Q1400956) (← links)
- On the number of occurrences of all short factors in almost all words. (Q1401211) (← links)
- Graphs of order \(n\) with locating-chromatic number \(n-1\) (Q1402068) (← links)
- The chromatic number of a graph of girth 5 on a fixed surface (Q1403910) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Codes for identification in the king lattice (Q1423495) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- Nondegenerate normal forms of Boolean functions. (Q1432316) (← links)
- On Tanner codes: Minimum distance and decoding (Q1566399) (← links)
- A five-color theorem (Q1567630) (← links)
- Extending partial colorings of graphs (Q1567669) (← links)
- A coloring problem on the \(n\)-cube (Q1570845) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- Resolvability in graphs and the metric dimension of a graph (Q1582071) (← links)
- A characterization of \(\Gamma\alpha(k)\)-perfect graphs (Q1586777) (← links)
- The pseudoachromatic number of a graph (Q1586845) (← links)
- On the number of large \(h\)-hypergraphs with a fixed diameter (Q1587613) (← links)
- The expressibility and completeness conditions for sheaves of logic functions (Q1593940) (← links)
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices (Q1594601) (← links)
- Uniquely colorable mixed hypergraphs (Q1598826) (← links)
- On the number of \(h\)-connected graphs with a fixed diameter (Q1613507) (← links)
- Flag-transitive point-quasiprimitive 2-\((v,\, k,\, 2)\) designs (Q1650808) (← links)
- A survey and strengthening of Erdős-Gyarfas conjecture (Q1677333) (← links)
- Harmonic index designs in binary Hamming schemes (Q1696524) (← links)
- A note on restricted list edge-colourings (Q1715081) (← links)
- On the synthesis and complexity of formulae with bounded depth of alternation (Q1759151) (← links)
- Two distance-regular graphs (Q1759331) (← links)
- Random walks and multiply intersecting families (Q1763876) (← links)
- A characterization of projective-planar signed graphs (Q1772410) (← links)
- Identity orientation of complete bipartite graphs (Q1772415) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number (Q1786880) (← links)
- Some combinatorial problems (Q1802136) (← links)
- Cyclic degrees of 3-polytopes (Q1808711) (← links)
- A polynomial time algorithm for constructing the refined Buneman tree (Q1808975) (← links)
- On the span in channel assignment problems: Bounds, computing and counting (Q1810659) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- Properly orderable graphs (Q1815322) (← links)
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327) (← links)
- On the Beck-Fiala theorem (Q1817567) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- La reduction minimale d'un graphe à une reunion de cliques (Q1846436) (← links)
- On the injective chromatic number of graphs (Q1849923) (← links)
- Dense critical and vertex-critical graphs (Q1850041) (← links)
- Defective choosability results for outerplanar and related graphs (Q1850061) (← links)
