Norbert Seifter - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2019

Infinite arc-transitive and highly-arc-transitive digraphsRögnvaldur G. Möller, Primoz Potocnik, Norbert Seifter. ejc, 77:78-89, 2019. [doi]

Sharply k-arc-transitive-digraphs: Finite and infinite examplesRögnvaldur G. Möller, Primoz Potocnik, Norbert Seifter. DM, 342(3):768-776, 2019. [doi]

2015

Reachability relations, transitive digraphs and groupsAleksander Malnic, Primoz Potocnik, Norbert Seifter, Primoz Sparl. arsmc, 8(1):83-94, 2015. [doi]

2009

Reachability Relations and the Structure of Transitive DigraphsNorbert Seifter, Vladimir Ivanovich Trofimov. combinatorics, 16(1), 2009. [doi]

2008

Reachability relations in digraphsAleksander Malnic, Dragan Marusic, Norbert Seifter, Primoz Sparl, Boris Zgrablic. ejc, 29(7):1566-1581, 2008. [doi]

Transitive digraphs with more than one endNorbert Seifter. DM, 308(9):1531-1537, 2008. [doi]

2005

Highly arc transitive digraphs: reachability, topological groupsAleksander Malnic, Dragan Marusic, Rögnvaldur G. Möller, Norbert Seifter, Vladimir Ivanovich Trofimov, Boris Zgrablic. ejc, 26(1):19-28, 2005. [doi]

2003

PrefaceSandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik. dmgt, 23(2):205, 2003. [doi]

2002

Highly Arc-Transitive Digraphs With No Homomorphism Onto ZAleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic. combinatorica, 22(3):435-443, 2002. [doi]

2001

Finite Contractions of Graphs with Polynomial GrowthAndrás Lukács, Norbert Seifter. ejc, 22(1):85-90, 2001. [doi]

2000

K-Dominating Sets of Cardinal Products of PathsAntoaneta Klobucar, Norbert Seifter. arscom, 55, 2000.

1999

Constructing Infinite One-regular GraphsAleksander Malnic, Dragan Marusic, Norbert Seifter. ejc, 20(8):845-853, 1999. [doi]

1998

Lattices in graphs with polynomial growthAndrás Lukács, Norbert Seifter. DM, 186(1-3):227-236, 1998. [doi]

Digraphical Regular Representations of Infinite Finitely Generated GroupsRögnvaldur G. Möller, Norbert Seifter. ejc, 19(5):597-602, 1998. [doi]

1997

Automorphism Groups of Graphs with Quadratic GrowthNorbert Seifter, Vladimir Ivanovich Trofimov. JCT, 71(2):205-210, 1997. [doi]

Automorphism Groups of Covering GraphsNorbert Seifter, Vladimir Ivanovich Trofimov. JCT, 71(1):67-72, 1997. [doi]

1995

Dominating Cartesian Products of CyclesSandi Klavzar, Norbert Seifter. DAM, 59(2):129-136, 1995. [doi]

1993

On the girth of infinite graphsNorbert Seifter. DM, 118(1-3):275-283, 1993. [doi]

1992

Graphs with polynomial growth are covering graphsChris D. Godsil, Norbert Seifter. gc, 8(3):233-241, 1992. [doi]

1991

A survey on graphs with polynomial growthWilfried Imrich, Norbert Seifter. DM, 95(1-3):101-117, 1991. [doi]

Properties of graphs with polynomial growthNorbert Seifter. JCT, 52(2):222-235, 1991. [doi]

Groups acting on graphs with polynomial growthNorbert Seifter. DM, 89(3):269-280, 1991. [doi]

1989

A note on bounded automorphisms of infinite graphsChris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess. gc, 5(1):333-338, 1989. [doi]

A note on the growth of transitive graphsWilfried Imrich, Norbert Seifter. DM, 73(1-2):111-117, 1989. [doi]

On the Action of Nilpotent and Metabelian Groups on Infinite, Locally Finite GraphsNorbert Seifter. ejc, 10(1):41-45, 1989. [doi]

1988

Nilpotent groups and transitive graphsNorbert Seifter. JCT, 45(3):356-366, 1988. [doi]

1986

A note on infinite transitive graphsNorbert Seifter. DM, 58(3):317-321, 1986. [doi]

1984

On automorphisms of infinite graphs with forbidden subgraphsNorbert Seifter. combinatorica, 4(4):351-356, 1984.

Sign in or sign up to see more results.

runs on WebDSL