EuDML | Browse

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

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 421 – 440 of 669

On the asymptotic behavior of some counting functions, II

Wolfgang A. Schmid (2005)

Colloquium Mathematicae

The investigation of the counting function of the set of integral elements, in an algebraic number field, with factorizations of at most k different lengths gives rise to a combinatorial constant depending only on the class group of the number field and the integer k. In this paper the value of these constants, in case the class group is an elementary p-group, is estimated, and determined under additional conditions. In particular, it is proved that for elementary 2-groups these constants are equivalent...

On the chromatic number of intersection graphs of convex sets in the plane.

Kim, Seog-Jin, Kostochka, Alexandr, Nakprasit, Kittikorn (2004)

The Electronic Journal of Combinatorics [electronic only]

On the chromatic number of rational five-space.

Kiran B. Chilakamarri (1990)

Aequationes mathematicae

On the Chvàtal-Erdős triangle game.

Balogh, József, Samotij, Wojciech (2011)

The Electronic Journal of Combinatorics [electronic only]

On the classification and toughness of generalized permutation star-graphs

Chong-Yun Chao, Shaocen Han (1997)

Czechoslovak Mathematical Journal

We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star-graphs.

On the crossing number of $K_{m, n}$ .

Nahas, Nagi H. (2003)

The Electronic Journal of Combinatorics [electronic only]

On the degrees of graphs with $α (G) \leq 2$

Jaroslav Morávek (1973)

Časopis pro pěstování matematiky

On the discrepancy of coloring finite sets.

Hajela, D. (1990)

International Journal of Mathematics and Mathematical Sciences

On the domination of functions by graphs

S. F. Kapoor, Linda M. Lesniak (1976)

Colloquium Mathematicae

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs

Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi, Khodakhast Bibak (2014)

Discussiones Mathematicae Graph Theory

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs

On the estrada index of graphs with given number of cut edges.

Du, Zhibin, Zhou, Bo (2011)

ELA. The Electronic Journal of Linear Algebra [electronic only]

On the existence of critically n-connected graphs

Ferdinand Gliviak (1976)

Mathematica Slovaca

On the first eigenvalue of bipartite graphs.

Bhattacharya, Amitava, Friedland, Shmuel, Peled, Uri N. (2008)

The Electronic Journal of Combinatorics [electronic only]

On the forcing geodetic and forcing steiner numbers of a graph

A.P. Santhakumaran, J. John (2011)

Discussiones Mathematicae Graph Theory

For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset of W. The...

Currently displaying 421 – 440 of 669

Previous Page 22 Next

Displaying 421 – 440 of 669

On the asymptotic behavior of some counting functions, II

On the chromatic number of intersection graphs of convex sets in the plane.

On the chromatic number of rational five-space.

On the Chvàtal-Erdős triangle game.

On the classification and toughness of generalized permutation star-graphs

On the crossing number of $K_{m, n}$ .

On the degrees of graphs with $α (G) \leq 2$

On the discrepancy of coloring finite sets.

On the domination of functions by graphs

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs

On the estrada index of graphs with given number of cut edges.

On the existence of critically n-connected graphs

On the first eigenvalue of bipartite graphs.

On the forcing geodetic and forcing steiner numbers of a graph

On the graphs with maximum distance or $k$ -diameter

On the impossibility to construct diametrically critical graphs by extensions

On the interchange heuristic for locating centers and medians in a graph

On the line graph of the square and the square of the line graph of a connected graph

On the lower bound for the chromatic number of graphs with given maximal degree and girth.

On the maximum automorphism group of self-complementary graphs

Currently displaying 421 – 440 of 669