Add to ORKGAbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractA simple undirected graph G=(V,E) is a rigidity circuit if |E|=2|V|−2 and |EG[X]|≤2|X|−3 for...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryDepartment of the Arm...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
AbstractLet G be the circuit graph of any connected matroid. It is proved that for any two vertices ...
AbstractIn the algorithm for the disjoint paths problem given in Graph Minors XIII, we used without ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
Let v be a vertex of a graph G; a transition graph T(v) of v is a graph whose vertices are the edges...
Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. T is...
Seidel's switching is a graph operation , which for a given graph G and one of its vertices v gives ...
summary:The well known types of routes in graphs and directed graphs, such as walks, trails, paths, ...
Graph theory ia a branch of mathematics which deals with networks of points connected by lines calle...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
AbstractWe call a graph G (k,n)-path-connected iff for any subset A of the vertex set of G with card...
AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractA simple undirected graph G=(V,E) is a rigidity circuit if |E|=2|V|−2 and |EG[X]|≤2|X|−3 for...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryDepartment of the Arm...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
AbstractLet G be the circuit graph of any connected matroid. It is proved that for any two vertices ...
AbstractIn the algorithm for the disjoint paths problem given in Graph Minors XIII, we used without ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
Let v be a vertex of a graph G; a transition graph T(v) of v is a graph whose vertices are the edges...
Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. T is...
Seidel's switching is a graph operation , which for a given graph G and one of its vertices v gives ...
summary:The well known types of routes in graphs and directed graphs, such as walks, trails, paths, ...
Graph theory ia a branch of mathematics which deals with networks of points connected by lines calle...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
AbstractWe call a graph G (k,n)-path-connected iff for any subset A of the vertex set of G with card...
AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractA simple undirected graph G=(V,E) is a rigidity circuit if |E|=2|V|−2 and |EG[X]|≤2|X|−3 for...