AbstractMotivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity
AbstractWe generalize a known sufficient condition for the traceability of a graph to a condition fo...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
A spanning generalized caterpillar is a spanning tree in which all vertices of degree more than two ...
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 ...
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 ...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
AbstractMotivated by a problem in the design of optical networks, we ask when a graph has a spanning...
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree thre...
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree thre...
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree thre...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
AbstractWe generalize a known sufficient condition for the traceability of a graph to a condition fo...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
A spanning generalized caterpillar is a spanning tree in which all vertices of degree more than two ...
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 ...
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 ...
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider ...
AbstractMotivated by a problem in the design of optical networks, we ask when a graph has a spanning...
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree thre...
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree thre...
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree thre...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
AbstractWe generalize a known sufficient condition for the traceability of a graph to a condition fo...
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spa...
A spanning generalized caterpillar is a spanning tree in which all vertices of degree more than two ...
DOI
Add to ORKG