
infinite graph
Characterizing (aleph_0,aleph_1)-graphs ★★★
Call a graph an -graph if it has a bipartition
so that every vertex in
has degree
and every vertex in
has degree
.

Keywords: binary tree; infinite graph; normal spanning tree; set theory
Highly arc transitive two ended digraphs ★★
Author(s): Cameron; Praeger; Wormald


Keywords: arc transitive; digraph; infinite graph
Strong matchings and covers ★★★
Author(s): Aharoni
Let be a hypergraph. A strongly maximal matching is a matching
so that
for every matching
. A strongly minimal cover is a (vertex) cover
so that
for every cover
.




Keywords: cover; infinite graph; matching
Unfriendly partitions ★★★
If is a graph, we say that a partition of
is unfriendly if every vertex has at least as many neighbors in the other classes as in its own.
Keywords: coloring; infinite graph; partition
Hamiltonian cycles in powers of infinite graphs ★★
Author(s): Georgakopoulos
- \item If


Keywords: hamiltonian; infinite graph
Hamiltonian cycles in line graphs of infinite graphs ★★
Author(s): Georgakopoulos
- \item If




Keywords: hamiltonian; infinite graph; line graphs
Infinite uniquely hamiltonian graphs ★★
Author(s): Mohar

Keywords: hamiltonian; infinite graph; uniquely hamiltonian
Unions of triangle free graphs ★★★


Keywords: forbidden subgraph; infinite graph; triangle free
Seymour's self-minor conjecture ★★★
Author(s): Seymour
Keywords: infinite graph; minor
