Green walks in a hypergraph
Wolfgang Rump (1998)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Generalized Brauer tree orders”
Green walks in a hypergraph
Deciding soccer scores and partial orientations of graphs.
Pálvölgyi, Dömötör (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Andreica, Mugurel Ionuţ, Ţăpuş, Nicolae (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Degree-constrained edge partitioning in graphs arising from discrete tomography.
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
Helly Property for Subtrees
Jessica Enright, Piotr Rudnicki (2008)
Formalized Mathematics
Similarity:
We prove, following [5, p. 92], that any family of subtrees of a finite tree satisfies the Helly property.MML identifier: HELLY, version: 7.8.09 4.97.1001
Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Expected lengths of minimum spanning trees for non-identical edge distributions.
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Relating different cycle spaces of the same infinite graph.
Richter, R. Bruce, Rooney, Brendan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Diameter in walk graphs.
Vetrík, T. (2007)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Total weight choosability of graphs.
Przybyło, Jakub, Woźniak, Mariusz (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: