AbstractThe induced path transit function J(u,v) in a graph consists of the set of all vertices lying on any induced path between the vertices u and v. A transit function J satisfies monotone axiom if x,y∈J(u,v) implies J(x,y)⊆J(u,v). A transit function J is said to satisfy the Peano axiom if, for any u,v,w∈V,x∈J(v,w), y∈J(u,x), there is a z∈J(u,v) such that y∈J(w,z). These two axioms are equivalent for the induced path transit function of a graph. Planar graphs for which the induced path transit function satisfies the monotone axiom are characterized by forbidden induced subgraphs
For any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it contains...
Paths $$P^1,\ldots,P^k$$ in a graph $$G=(V,E)$$ are mutually induced if any two distinct $$P^i$$ and...
We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erdo...
AbstractThe induced path transit function J(u,v) in a graph consists of the set of all vertices lyin...
A transit function R on a set V is a function R: V × V → 2V satisfying the axiom
summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying...
AbstractThe geodesic and induced path transit functions are the two well-studied interval functions ...
textabstractThe notion of transit function is introduced to present a unifying approach for results ...
Definition(s): A transit function on a set V is a function R:V ×V → 2V satisfying the following axio...
International audienceA graph is a path graph if it is the intersection graph of a family of subpath...
AbstractThe induced path interval J(u,v) consists of the vertices on the induced paths between u and...
We study domination between different types of walks connecting two non-adjacent vertices u and v of...
A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every e...
AbstractFor any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it ...
We study domination between different types of walks connecting two non-adjacent vertices u and v of...
For any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it contains...
Paths $$P^1,\ldots,P^k$$ in a graph $$G=(V,E)$$ are mutually induced if any two distinct $$P^i$$ and...
We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erdo...
AbstractThe induced path transit function J(u,v) in a graph consists of the set of all vertices lyin...
A transit function R on a set V is a function R: V × V → 2V satisfying the axiom
summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying...
AbstractThe geodesic and induced path transit functions are the two well-studied interval functions ...
textabstractThe notion of transit function is introduced to present a unifying approach for results ...
Definition(s): A transit function on a set V is a function R:V ×V → 2V satisfying the following axio...
International audienceA graph is a path graph if it is the intersection graph of a family of subpath...
AbstractThe induced path interval J(u,v) consists of the vertices on the induced paths between u and...
We study domination between different types of walks connecting two non-adjacent vertices u and v of...
A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every e...
AbstractFor any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it ...
We study domination between different types of walks connecting two non-adjacent vertices u and v of...
For any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it contains...
Paths $$P^1,\ldots,P^k$$ in a graph $$G=(V,E)$$ are mutually induced if any two distinct $$P^i$$ and...
We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erdo...