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 181 – 200 of 455

Hamiltonian connectedness and a matching in powers of connected graphs

Elena Wisztová (1995)

Mathematica Bohemica

In this paper the following results are proved: 1. Let $P_{n}$ be a path with $n$ vertices, where $n \geq 5$ and $n \neq 7, 8$ . Let $M$ be a matching in $P_{n}$ . Then ${(P_{n})}^{4} - M$ is hamiltonian-connected. 2. Let $G$ be a connected graph of order $p \geq 5$ , and let $M$ be a matching in $G$ . Then $G^{5} - M$ is hamiltonian-connected.

Homomorphisms of infinite bipartite graphs onto complete bipartite graphs

Bohdan Zelinka (1983)

Czechoslovak Mathematical Journal

Hyperbolic and Parabolic Packings.

Zheng-Xu He, O. Schramm (1995)

Discrete & computational geometry

Identifying codes with small radius in some infinite regular graphs.

Charon, Irène, Hudry, Olivier, Lobstein, Antoine (2002)

The Electronic Journal of Combinatorics [electronic only]

Impaccando $T$ -tagli e $T$ giunti

Romeo Rizzi (1998)

Bollettino dell'Unione Matematica Italiana

Independence number and minimum degree for the existence of $(g, f, n)$ -critical graphs.

Zhou, Sizhong, Pan, Quanru, Xu, Yang (2011)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Independent face and vertex covers in plane graphs

Maciej M. Sysło (1989)

Banach Center Publications

Independent vertex sets in some compound graphs.

Gutman, Ivan (1992)

Publications de l'Institut Mathématique. Nouvelle Série

Induced complete $h$ -partite graphs in dense clique-less graphs.

Fischer, Eldar (1999)

The Electronic Journal of Combinatorics [electronic only]

Inequivalent Regular Factors of Regular Graphs on 8 Vertices

Zoran S. Radosavljević (1981)

Publications de l'Institut Mathématique

Interval edge colorings of some products of graphs

Petros A. Petrosyan (2011)

Discussiones Mathematicae Graph Theory

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...

Currently displaying 181 – 200 of 455

Previous Page 10 Next

Displaying 181 – 200 of 455

Hamiltonian connectedness and a matching in powers of connected graphs

Homomorphisms of infinite bipartite graphs onto complete bipartite graphs

Hyperbolic and Parabolic Packings.

Identifying codes with small radius in some infinite regular graphs.

Impaccando $T$ -tagli e $T$ giunti

Independence number and minimum degree for the existence of $(g, f, n)$ -critical graphs.

Independent face and vertex covers in plane graphs

Independent vertex sets in some compound graphs.

Induced complete $h$ -partite graphs in dense clique-less graphs.

Inequivalent Regular Factors of Regular Graphs on 8 Vertices

Interval edge colorings of some products of 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.

$k$ -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

Currently displaying 181 – 200 of 455