Add to ORKGCoordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DAAB 07-67-C-019
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractLet ω: Ḡ→G be a wrapped covering of graphs and let G be enbedded in a surface S. It is known...
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected...
AbstractSome basic results on duality of infinite graphs are established and it is proven that a blo...
AbstractWe generalize the natural duality of graphs embedded into a surface to a duality with respec...
AbstractWe generalize the natural duality of graphs embedded into a surface to a duality with respec...
Let K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set of graph...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractAlthough chordal graphs may seem at first to be a poor choice to approach using cycle/cutset...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree f...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractLet ω: Ḡ→G be a wrapped covering of graphs and let G be enbedded in a surface S. It is known...
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected...
AbstractSome basic results on duality of infinite graphs are established and it is proven that a blo...
AbstractWe generalize the natural duality of graphs embedded into a surface to a duality with respec...
AbstractWe generalize the natural duality of graphs embedded into a surface to a duality with respec...
Let K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set of graph...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractAlthough chordal graphs may seem at first to be a poor choice to approach using cycle/cutset...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree f...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractLet ω: Ḡ→G be a wrapped covering of graphs and let G be enbedded in a surface S. It is known...
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected...