AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph to have a spanning subgraph with a specified positive valency at each vertex (see [8,9]). In the present paper it is contended that the condition can be made more useful as a tool of graph theory by imposing a maximality condition
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
The Merino–Welsh conjecture asserts that the number of spanning trees of a graph is no greater than ...
AbstractThe author has published a necessary and sufficient condition for a finite loopless graph to...
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
AbstractThe author has published a necessary and sufficient condition for a finite loopless graph to...
In [1] V. G. Vizing proposes the problem of finding an algorithm for finding a spanning tree of a gi...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
AbstractWe generalize a known sufficient condition for the traceability of a graph to a condition fo...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. ...
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
An eulerian subgraph of a graph is called a circuit. As shown by Harary and Nash-Williams, the exist...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
The Merino–Welsh conjecture asserts that the number of spanning trees of a graph is no greater than ...
AbstractThe author has published a necessary and sufficient condition for a finite loopless graph to...
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
AbstractThe author has published a necessary and sufficient condition for a finite loopless graph to...
In [1] V. G. Vizing proposes the problem of finding an algorithm for finding a spanning tree of a gi...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
AbstractWe generalize a known sufficient condition for the traceability of a graph to a condition fo...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. ...
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
An eulerian subgraph of a graph is called a circuit. As shown by Harary and Nash-Williams, the exist...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
The Merino–Welsh conjecture asserts that the number of spanning trees of a graph is no greater than ...
DOI
Add to ORKG