The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- Complete hyperbolic lattices derived from tessellations of type \(\{4g,4g\}\) (Q2816930) (← links)
- On generalized zero-difference balanced functions (Q2820724) (← links)
- Perfect state transfer between non-antipodal vertices in integral circulant graphs. (Q2828846) (← links)
- On metric dimension of convex polytopes with pendant edges. (Q2828971) (← links)
- Upper bounds of four types of graph labelings. (Q2829048) (← links)
- A novel cryptosystem based on abstract automata and Latin cubes (Q2834169) (← links)
- Total vertex covers (Q2839639) (← links)
- Fully automorphic decompositions of graphs (Q2839731) (← links)
- On the cyclomatic number of linear hypergraphs. (Q2846670) (← links)
- Ordering connected graphs having small degree distances. II (Q2856694) (← links)
- Super edge-magic total labeling of a tree (Q2860834) (← links)
- On the \(q\)-derivative and \(q\)-series expansions (Q2870232) (← links)
- On the representability of the biuniform matroid (Q2870516) (← links)
- On metric dimension of flower graphs \(f_{n \times m}\) and convex polytopes (Q2870975) (← links)
- On proofs of certain combinatorial identities (Q2883394) (← links)
- Combinatorial chessboard tilings (Q2883416) (← links)
- On the Connected Partition Dimension of a Wheel Related Graph (Q2891330) (← links)
- Computational complexity of Boolean functions (Q2892023) (← links)
- On vertext-magic total labeling of some families of rotationally-symmetric graphs (Q2895395) (← links)
- Extremal properties of the chromatic polynomials of connected 3-chromatic graphs (Q2914003) (← links)
- Magic graphs with pendant edges. (Q2918617) (← links)
- (Q2941350) (← links)
- (Q2972781) (← links)
- (Q2975358) (← links)
- (Q2999644) (← links)
- An upper bound for the shortest hamiltonian path in the symmetric euclidean case (Q3037474) (← links)
- (Q3052835) (← links)
- (Q3090706) (← links)
- (Q3214930) (← links)
- A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS (Q3220628) (← links)
- On Hamiltonian-connected regular graphs (Q3309870) (← links)
- (Q3317158) (← links)
- Digital metrics: A graph-theoretical approach (Q3337513) (← links)
- (Q3344018) (← links)
- (Q3360205) (← links)
- From rankings’ collinearity to counting SDR's via chromatic list expression (Q3396413) (← links)
- Some Results on Chromaticity of Quasilinear Hypergraphs (Q3462328) (← links)
- Maximal chromatic polynomials of connected planar graphs (Q3480061) (← links)
- ON DISTANCES IN CHROMATIC GRAPHS (Q3480062) (← links)
- (Q3491605) (← links)
- (Q3530898) (← links)
- (Q3553815) (← links)
- On the Ramsey numbers for paths and generalized Jahangir graphs (Q3559420) (← links)
- (Q3568750) (← links)
- (Q3615600) (← links)
- (Q3698832) (← links)
- (Q3718734) (← links)
- Metric bases in digital geometry (Q3719384) (← links)
- (Q3722532) (← links)
- ON HYPERGRAPH COLOURINGS (Q3728019) (← links)
