Homomorphisms of infinite bipartite graphs onto complete bipartite graphs
Hyperbolic and Parabolic Packings.
Identifying codes with small radius in some infinite regular graphs.
Impaccando -tagli e giunti
Independence number and minimum degree for the existence of -critical graphs.
Independent face and vertex covers in plane graphs
Independent vertex sets in some compound graphs.
Induced complete -partite graphs in dense clique-less graphs.
Inequivalent Regular Factors of Regular Graphs on 8 Vertices
Interval edge colorings of some products of graphs
An edge coloring of a graph G with colors 1,2,...,t is called an interval t-coloring if for each i ∈ {1,2,...,t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable, if there is an integer t ≥ 1 for which G has an interval t-coloring. Let ℜ be the set of all interval colorable graphs. In 2004 Kubale and Giaro showed that if G,H ∈ 𝔑, then the Cartesian product of these graphs...
i-perfect m-cycle systems, m...19.
Isomorphic factorisations of complete graphs into factors with a given diameter
Isomorphisms of cyclic abelian covers of symmetric digraphs. II.
Jamming and geometric representations of graphs.
-cycle free one-factorizations of complete graphs.
Latin squares with forbidden entries.
Leaves, excesses and neighborhoods
Lexicographic product of extendable graphs.
Linear arboricity of graphs
List coloring of complete multipartite graphs
The choice number of a graph G is the smallest integer k such that for every assignment of a list L(v) of k colors to each vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from L(v). We present upper and lower bounds on the choice number of complete multipartite graphs with partite classes of equal sizes and complete r-partite graphs with r-1 partite classes of order two.