AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n disjoint graphs each isomorphic to G, and (II) H does not contain infinitely many disjoint graphs each isomorphic to G. This answers one of the questions raised by Halin in the Graph Theory Newsletter
28 pages, 4 figuresWe resolve the computational complexity of Graph Isomorphism for classes of graph...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractFor every countable, connected graph A containing no one-way infinite path the following is ...
AbstractLake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to ...
AbstractLet A be an arbitrary locally finite, infinite tree and assume that a graph G contains for e...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractIt is shown that two hypomorphic infinite graphs always have the same number of blocks. This...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
It is known that any graph with six vertices cannot be isomorphic to its complement [3].V. K. Balakr...
AbstractWe show that a graph can always be decomposed into edge-disjoint subgraphs of countable card...
A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G....
International audienceAbstract We resolve the computational complexity of Graph Isomorphism for clas...
We present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs such that...
28 pages, 4 figuresWe resolve the computational complexity of Graph Isomorphism for classes of graph...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractFor every countable, connected graph A containing no one-way infinite path the following is ...
AbstractLake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to ...
AbstractLet A be an arbitrary locally finite, infinite tree and assume that a graph G contains for e...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractIt is shown that two hypomorphic infinite graphs always have the same number of blocks. This...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
It is known that any graph with six vertices cannot be isomorphic to its complement [3].V. K. Balakr...
AbstractWe show that a graph can always be decomposed into edge-disjoint subgraphs of countable card...
A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G....
International audienceAbstract We resolve the computational complexity of Graph Isomorphism for clas...
We present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs such that...
28 pages, 4 figuresWe resolve the computational complexity of Graph Isomorphism for classes of graph...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
DOI
Add to ORKG