The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Precise Perfect Colorings of Archimedean Tessellations”

Mycielskians and matchings

Tomislav Doslić (2005)

Discussiones Mathematicae Graph Theory

Similarity:

It is shown in this note that some matching-related properties of graphs, such as their factor-criticality, regularizability and the existence of perfect 2-matchings, are preserved when iterating Mycielski's construction.

On a perfect problem

Igor E. Zverovich (2006)

Discussiones Mathematicae Graph Theory

Similarity:

We solve Open Problem (xvi) from Perfect Problems of Chvátal [1] available at ftp://dimacs.rutgers.edu/pub/perfect/problems.tex: Is there a class C of perfect graphs such that (a) C does not include all perfect graphs and (b) every perfect graph contains a vertex whose neighbors induce a subgraph that belongs to C? A class P is called locally reducible if there exists a proper subclass C of P such that every graph in P contains a local subgraph...

Odd perfect numbers of a special form

Tomohiro Yamada (2005)

Colloquium Mathematicae

Similarity:

We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.

On near-perfect and deficient-perfect numbers

Min Tang, Xiao-Zhi Ren, Meng Li (2013)

Colloquium Mathematicae

Similarity:

For a positive integer n, let σ(n) denote the sum of the positive divisors of n. Let d be a proper divisor of n. We call n a near-perfect number if σ(n) = 2n + d, and a deficient-perfect number if σ(n) = 2n - d. We show that there is no odd near-perfect number with three distinct prime divisors and determine all deficient-perfect numbers with at most two distinct prime factors.