The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- Irreducible coverings by cliques and Sperner's theorem (Q1856342) (← links)
- The length of the shortest edge of a graph on a sphere (Q1864585) (← links)
- Tails of bipartite distance-regular graphs (Q1864613) (← links)
- Factor \(d\)-domatic colorings of graphs (Q1868834) (← links)
- Relaxed game chromatic number of graphs (Q1868839) (← links)
- Bounds on the chromatic number of intersection graphs of sets in the plane (Q1868853) (← links)
- Construction of \(K_{n}\)-minor free graphs with given circular chromatic number (Q1869205) (← links)
- Strongly regular decompositions of the complete graph (Q1870287) (← links)
- Sunflower hypergraphs are chromatically unique (Q1877684) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- Further enumerating Boolean functions of cryptographic significance (Q1895962) (← links)
- A polynomial expansion of \(k\)-valued functions with respect to nondegenerate functions (Q1897226) (← links)
- Discs in unbreakable graphs (Q1900520) (← links)
- A new class of perfect Hoàng graphs (Q1901048) (← links)
- Large faces in 4-critical planar graphs with minimum degree 4 (Q1906842) (← links)
- The chromatic polynomial between graph \& its complement---about Akiyama and Harary's open problem (Q1906858) (← links)
- Remarks on direct computation for \(P(n,k)\) (Q1908954) (← links)
- A method of enumeration of negative cycles of a signed graph (Q1916123) (← links)
- On the number of irreducible coverings by edges of complete bipartite graphs (Q1916141) (← links)
- Negative cycles in complete signed graphs (Q1917352) (← links)
- On bounding the chromatic number of L-graphs (Q1918550) (← links)
- Chromaticity of series-parallel graphs (Q1918563) (← links)
- Bonferroni inequalities and negative cycles in large complete signed graphs (Q1922875) (← links)
- An asymptotic formula for the number of graphs having small diameter (Q1923514) (← links)
- Transformations of cubic graphs (Q1925057) (← links)
- Some extremal properties of the degree distance of a graph (Q1961241) (← links)
- Necessary condition for a chromatic polynomial (Q1968570) (← links)
- Edge colorings of \(K_{2n}\) with a prescribed condition. I (Q1971213) (← links)
- Decompositions of edge-colored complete graphs (Q1971615) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- List improper colorings of planar graphs with prescribed girth (Q1972143) (← links)
- Independent transversals of hypergraph edges and bipartite bigraphs (Q1974346) (← links)
- On the tight span of an antipodal graph (Q1978148) (← links)
- The threshold dimension of a graph (Q2004085) (← links)
- Computing graph gonality is hard (Q2004086) (← links)
- Super-simple BIBDs with block size 4 and index 7 (Q2005681) (← links)
- On clique immersions in line graphs (Q2005686) (← links)
- Minimum degree and diversity in intersecting antichains (Q2036583) (← links)
- A Snevily-type inequality for multisets (Q2043675) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Existence of monochromatic simplices of given volume in a colored rational lattice (Q2049318) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Erratum to: ``High order random walks: beyond spectral gap'' (Q2064755) (← links)
- Some unexpected properties of Littlewood-Richardson coefficients (Q2094877) (← links)
- On the Hamiltonian property hierarchy of 3-connected planar graphs (Q2094888) (← links)
- Extractors for small zero-fixing sources (Q2095117) (← links)
- Progress on local properties problems of difference sets (Q2107491) (← links)
- On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs (Q2107753) (← links)
- The threshold dimension and irreducible graphs (Q2107754) (← links)
