AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence classes induced by the graph homomorphisms from Pn onto Pk is determined. This settles an open problem of Michels and Knauer [M. A. Michels, U. Knauer, The congruence classes of paths and cycles, Discrete Mathematics, 309 (2009) 5352–5359]. Our result is based on a new proven formula of the number of homomorphisms between paths
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
26 pagesIn this paper we show that every graph of pathwidth less than $k$ that has a path of order $...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
11 pages, 2 figures, to appear in Discrete MathematicsInternational audienceLet $P_n$ denote the und...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
AbstractBy traversing square lattices, the cardinality of the set of congruence classes induced by t...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
Let hom(G,H) denote the number of homomorphisms from a graph G to a graph H. In this paper we study ...
AbstractA homomorphism of a graph G1=(V1,E1) to a graph G2=(V2,E2) is a mapping from the vertex set ...
We investigate bounds on the chromatic number of a graph G de-rived from the nonexistence of homomor...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
As a generalization of isomorphisms of graphs, we consider path-congruences, that is maps which pres...
Graduation date: 1963This thesis treats the problem of enumerating equivalence\ud classes of Euler p...
AbstractAn endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
26 pagesIn this paper we show that every graph of pathwidth less than $k$ that has a path of order $...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
11 pages, 2 figures, to appear in Discrete MathematicsInternational audienceLet $P_n$ denote the und...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
AbstractBy traversing square lattices, the cardinality of the set of congruence classes induced by t...
AbstractWe determine the number of locally strong endomorphisms of directed and undirected paths—dir...
Let hom(G,H) denote the number of homomorphisms from a graph G to a graph H. In this paper we study ...
AbstractA homomorphism of a graph G1=(V1,E1) to a graph G2=(V2,E2) is a mapping from the vertex set ...
We investigate bounds on the chromatic number of a graph G de-rived from the nonexistence of homomor...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
As a generalization of isomorphisms of graphs, we consider path-congruences, that is maps which pres...
Graduation date: 1963This thesis treats the problem of enumerating equivalence\ud classes of Euler p...
AbstractAn endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
26 pagesIn this paper we show that every graph of pathwidth less than $k$ that has a path of order $...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
DOI
Add to ORKG