EuDML | Browse

Page 1

Displaying 1 – 10 of 10

Improved bounds for the number of forests and acyclic orientations in the square lattice.

Calkin, N., Merino, C., Noble, S., Noy, M. (2003)

The Electronic Journal of Combinatorics [electronic only]

In the Square of Graphs, Hamiltonicity and Pancyclicity, Hamiltonian Connectedness and Panconnectedness Are Equivalent Concepts.

H. Fleischner (1976)

Monatshefte für Mathematik

Independence number and disjoint theta graphs.

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Independent cycles and paths in bipartite balanced graphs

Beata Orchel, A. Paweł Wojda (2008)

Discussiones Mathematicae Graph Theory

Bipartite graphs G = (L,R;E) and H = (L’,R’;E’) are bi-placeabe if there is a bijection f:L∪R→ L’∪R’ such that f(L) = L’ and f(u)f(v) ∉ E’ for every edge uv ∈ E. We prove that if G and H are two bipartite balanced graphs of order |G| = |H| = 2p ≥ 4 such that the sizes of G and H satisfy ||G|| ≤ 2p-3 and ||H|| ≤ 2p-2, and the maximum degree of H is at most 2, then G and H are bi-placeable, unless G and H is one of easily recognizable couples of graphs. This result implies easily that for integers...

Induced paths in twin-free graphs.

Auger, David (2008)

The Electronic Journal of Combinatorics [electronic only]

Induced subgraphs with the same order and size

Juraj Bosák (1983)

Mathematica Slovaca

Induced-paired domatic numbers of graphs

Bohdan Zelinka (2002)

Mathematica Bohemica

A subset $D$ of the vertex set $V (G)$ of a graph $G$ is called dominating in $G$ , if each vertex of $G$ either is in $D$ , or is adjacent to a vertex of $D$ . If moreover the subgraph $< D >$ of $G$ induced by $D$ is regular of degree 1, then $D$ is called an induced-paired dominating set in $G$ . A partition of $V (G)$ , each of whose classes is an induced-paired dominating set in $G$ , is called an induced-paired domatic partition of $G$ . The maximum number of classes of an induced-paired domatic partition of $G$ is the induced-paired domatic...

Displaying 1 – 10 of 10

Improved bounds for the number of forests and acyclic orientations in the square lattice.

In the Square of Graphs, Hamiltonicity and Pancyclicity, Hamiltonian Connectedness and Panconnectedness Are Equivalent Concepts.

Independence number and disjoint theta graphs.

Independent cycles and paths in bipartite balanced graphs

Induced paths in twin-free graphs.

Induced subgraphs with the same order and size

Induced-paired domatic numbers of graphs

Intersection number of a graph

Interval edge-coloring of caterpillars with hairs of arbitrary length

Irreducible coverings by cliques and Sperner's theorem.

Currently displaying 1 – 10 of 10