The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- On Krein graphs without triangles (Q2455230) (← links)
- Characterization of digraphs with equal domination graphs and underlying graphs (Q2463466) (← links)
- The alliance partition number of grid graphs (Q2469300) (← links)
- Global alliances in planar graphs (Q2469302) (← links)
- Analogues of Cayley graphs for topological groups (Q2471031) (← links)
- The Ramsey numbers of large cycles versus odd wheels (Q2482346) (← links)
- Taut distance-regular graphs and the subconstituent algebra (Q2502897) (← links)
- Discrepancies between metric dimension and partition dimension of a connected graph (Q2519818) (← links)
- La construction des tests minimaux pour les fonctions booleennes symétriques (Q2540275) (← links)
- Une démonstration du théorème de Dilworth et applications à un problème de couverture des graphes (Q2543955) (← links)
- Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph) (Q2548964) (← links)
- The number of connected graphs with \(k\) cycles on labeled nodes (Q2555870) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Counting corners in partitions (Q2634576) (← links)
- On the chromaticity of quasi linear hypergraphs (Q2637737) (← links)
- The size of uniquely colorable graphs (Q2641312) (← links)
- Edge fault-tolerance of strongly Menger edge connected graphs (Q2666578) (← links)
- Cycles on a multiset with only even-odd drops (Q2666580) (← links)
- Fusions of the generalized Hamming scheme on a strongly-regular graph (Q2674384) (← links)
- The Terwilliger algebra of symplectic dual polar graphs, the subspace lattices and \(U_q(\mathrm{sl}_2)\) (Q2675872) (← links)
- Elements of graph theory. From basic concepts to modern developments (Q2679076) (← links)
- Young row-strict quasisymmetric Schur functions and 0-Hecke modules (Q2680947) (← links)
- Algorithmic aspects of partial list colourings (Q2703027) (← links)
- Cyclic chromatic number of 3-connected plane graphs (Q2706194) (← links)
- On closure operators and the sieve formula (Q2707962) (← links)
- Properties of queens graphs and the irredundance number of \(Q_7\) (Q2712529) (← links)
- Pseudo-hamiltonian graphs (Q2714402) (← links)
- Alternative proofs of three theorems of Chetwynd and Hilton (Q2721338) (← links)
- Pascal pyramids and their applications. (Q2723295) (← links)
- A note on periodicity of the 2-distance operator (Q2725190) (← links)
- Some extremal properties of the degree distance of a graph (Q2737546) (← links)
- The Penrose polynomial of graphs and matroids (Q2741172) (← links)
- The ultracenter and central fringe of a graph (Q2747803) (← links)
- Ubiquity of Kostka polynomials (Q2751975) (← links)
- The number of graphs and digraphs with a fixed diameter and connectivity (Q2752140) (← links)
- Fractional chromatic numbers of cones over graphs (Q2757095) (← links)
- End compactifications in non-locally-finite graphs (Q2758155) (← links)
- From conjecture to theorem (Q2758331) (← links)
- Forbidding holes and antiholes (Q2758335) (← links)
- The number of \(h\)-strongly connected digraphs with small diameter (Q2760453) (← links)
- Weakly completable critical sets for proper vertex and edge colourings of graphs (Q2760455) (← links)
- The metric dimension and metric independence of a graph (Q2768132) (← links)
- The triangles method to build \(X\)-trees from incomplete distance matrices (Q2773174) (← links)
- On the geodetic number of a graph (Q2782725) (← links)
- Statistical curse of the second half rank, Eulerian numbers and Stirling numbers (Q2798945) (← links)
- The existence of 2 pairwise additive cyclic BIB designs with an even number of points (Q2799698) (← links)
- Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs. (Q2804793) (← links)
- Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting (Q2805407) (← links)
- Unicyclic connected graphs having smallest degree distances (Q2811701) (← links)
