Sciweavers

1883 search results - page 28 / 377
» Ordered theta graphs
Sort
View
DM
2002
104views more  DM 2002»
13 years 7 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
ORDER
2008
91views more  ORDER 2008»
13 years 7 months ago
Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
Manfred Droste, Robert Gray, John K. Truss
FSTTCS
2005
Springer
14 years 1 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
WG
1993
Springer
13 years 11 months ago
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
Andreas Brandstädt, Feodor F. Dragan, Victor ...
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 7 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena