On 3-colorable planar graphs without prescribed cycles

In this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-colorable.     

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles

A 2-coloring is a coloring of vertices of a graph with colors 1 and 2. Define $V_i?\{v\in V\left(G\right):c\left(v\right)=i\}$ for $i=1$ and $2.$ We say that $G$ is $(d_1,d_2)$-colorable if $G$ has a 2-coloring such that $V_i$ is an empty set or the induced subgraph $G\left[V_i\right]$ has the maximum degree at most $d_i$ for $i=1$ and $2.$ Let $G$ be a planar graph without 4-cycles and 5-cycles. We show that the problem to determine whether $G$ is $(0,k)$-colorable is NP-complete for every positive integer $k.$ Moreover, we construct non-$(1,k)$-colorable planar graphs without 4-cycles and 5-cycles for every positive integer $k.$ In contrast, we prove that $G$ is $(d_1,d_2)$-colorable where $(d_1,d_2)=(4,4),(3,5),$ and $(2,9).$     

Acyclic 5-choosability of planar graphs without 4-cycles

A proper vertex coloring of a graph G=(V,E) is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment L={L(v):v∈V}, there exists a proper acyclic coloring π of G such that π(v)∈L(v) for all v∈V. If G is acyclically L-list colorable for any list assignment with |L(v)|≥k for all v∈V, then G is acyclically k-choosable. In this paper we prove that every planar graph without 4-cycles and without two 3-cycles at distance less than 3 is acyclically 5-choosable. This improves a result in [M. Montassier, P. Ochem, A. Raspaud, On the acyclic choosability of graphs, J. Graph Theory 51 (2006) 281-300], which says that planar graphs of girth at least 5 are acyclically 5-choosable.     

Divisible designs with dual translation group

Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism group enables us to characterize its associated divisible design as being isomorphic to a substructure of a finite affine space.      

Equitable list coloring of planar graphs without 4- and 6-cycles

A graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L-colorable of G such that each color appears on at most vertices. Kostochka, Pelsmajer and West introduced this notion and conjectured that G is equitably k-choosable for k>Δ(G). We prove this for planar graphs with Δ(G)≥6 and no 4- or 6-cycles.     

Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles

A proper vertex coloring of a graph G=(V,E) is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment L={L(v):v∈V}, there exists a proper acyclic coloring ? of G such that ?(v)∈L(v) for all v∈V(G). If G is acyclically L-list colorable for any list assignment with |L(v)|≥k for all v∈V, then G is acyclically k-choosable. In this paper it is proved that every planar graph with neither 4-cycles nor chordal 6-cycles is acyclically 5-choosable. This generalizes the results of [M. Montassier, A. Raspaud, W. Wang, Acyclic 5-choosability of planar graphs without small cycles, J. Graph Theory 54 (2007) 245-260], and a corollary of [M. Montassier, P. Ochem, A. Raspaud, On the acyclic choosability of graphs, J. Graph Theory 51 (4) (2006) 281-300].     

End-regularity of zero-divisor graphs of group rings

A graph Γ is said to be End-regular if its endomorphism monoid End(Γ) is regular. D. Lu and T. Wu [25 Lu, D., Wu, T. (2008). On endomorphism-regularity of zero-divisor graphs. Discrete Math. 308:4811–4815.[Crossref], [Web of Science ®] , [Google Scholar]] posed an open problem: Given a ring R, when does the zero-divisor graph Γ(R) have a regular endomorphism monoid? and they solved the problem for R a commutative ring with at least one nontrivial idempotent. In this paper, we solve this problem for zero-divisor graphs of group rings.     

Note on cycle double covers of graphs

Kriesell [M. Kriesell, Contractions, cycle double covers and cyclic colorings in locally connected graphs, J. Combin. Theory Ser. B 96 (2006) 881-900] proved the cycle double cover conjecture for locally connected graphs. In this note, we give much shorter proofs for two stronger results.     

The fundamental group of a locally finite graph with ends

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the free groups π₁(G^′) with G^′⊆G finite.     

Smallest graphs with given generalized quaternion automorphism group

For , a smallest graph whose automorphism group is isomorphic to the generalized quaternion group is constructed. If , then such a graph has vertices and edges. In the special case when , a smallest graph has 16 vertices but 44 edges.     

Cayley graphs of the group ℤ4 and limits for minimal vertex-primitive graphs of HA-type

We point out a countable set of pairwise nonisomorphic Cayley graphs of the group ℤ⁴ that are limit for finite minimal vertex-primitive graphs admitting a vertex-primitive automorphism group containing a regular Abelian normal subgroup. Supported by RFBR grant No. 06-01-00378. __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 203–214, March–April, 2008.     

On even cycle decompositions of line graphs of cubic graphs

An even cycle decomposition of a graph is a partition of its edges into cycles of even length. In 2012, Markström conjectured that the line graph of every 2-connected cubic graph has an even cycle decomposition and proved this conjecture for cubic graphs with oddness at most 2. However, for 2-connected cubic graphs with oddness 2, Markström only considered these graphs with a chordless 2-factor. (A chordless 2-factor of a graph is a 2-factor consisting of only induced cycles.) In this paper, we first construct an infinite family of 2-connected cubic graphs with oddness 2 and without chordless 2-factors. We then give a complete proof of Markström’s result and further prove this conjecture for cubic graphs with oddness 4.     

Fundamental group in o-minimal structures with definable Skolem functions

In this paper we work in an arbitrary o-minimal structure with definable Skolem functions and prove that definably connected, locally definable manifolds are uniformly definably path connected, have an admissible cover by definably simply connected, open definable subsets and, definable paths and definable homotopies on such locally definable manifolds can be lifted to locally definable covering maps. These properties allow us to obtain the main properties of the general o-minimal fundamental group, including: invariance and comparison results; existence of universal locally definable covering maps; monodromy equivalence for locally constant o-minimal sheaves – from which one obtains, as in algebraic topology, classification results for locally definable covering maps, o-minimal Hurewicz and Seifert–van Kampen theorems.     

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable

It is shown that a planar graph without cycles of length 4, 5, 8, or 9 is 3-choosable.