EuDML | Browse

Page 1

Displaying 1 – 6 of 6

Hamilton cycles in split graphs with large minimum degree

Ngo Dac Tan, Le Xuan Hung (2004)

Discussiones Mathematicae Graph Theory

A graph G is called a split graph if the vertex-set V of G can be partitioned into two subsets V₁ and V₂ such that the subgraphs of G induced by V₁ and V₂ are empty and complete, respectively. In this paper, we characterize hamiltonian graphs in the class of split graphs with minimum degree δ at least |V₁| - 2.

Hexagonal 2-complexes have a strongly convex metric.

Andrica, Dorin, Lazăr, Ioana-Claudia (2011)

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

Histories in path graphs

Ludovít Niepel (2007)

Discussiones Mathematicae Graph Theory

For a given graph G and a positive integer r the r-path graph, $P_{r} (G)$ , has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length r-1, and their union forms either a cycle or a path of length k+1 in G. Let $P_{r}^{k} (G)$ be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of $P_{r}^{k} (G)$ . The k-history $P_{r}^{- k} (H)$ is a subgraph of G that is induced by all edges that take part in the recursive definition of...

Displaying 1 – 6 of 6

Hamilton cycles in split graphs with large minimum degree

Hexagonal 2-complexes have a strongly convex metric.

Histories in path graphs

How to find overfull subgraphs in graphs with large maximum degree. II.

Hyperbolicity and chordality of a graph.

Hypergraphs and intervals

Currently displaying 1 – 6 of 6