Gert Sabidussi

Affiliations:
  • Université de Montréal


According to our database1, Gert Sabidussi authored at least 26 papers between 1971 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Automorphism group and diameter of a graph.
J. Graph Theory, 2012

2010
Maximum independent sets in 3- and 4-regular Hamiltonian graphs.
Discret. Math., 2010

2009
On the geodesic pre-hull number of a graph.
Eur. J. Comb., 2009

2008
Embedding graphs as isometric medians.
Discret. Appl. Math., 2008

2005
Deeply asymmetric planar graphs.
J. Comb. Theory B, 2005

2003
3-colorability of 4-regular hamiltonian graphs.
J. Graph Theory, 2003

1997
Parity equivalence in eulerian graphs.
J. Graph Theory, 1997

1996
Graphs Without Dead Ends.
Eur. J. Comb., 1996

1995
Modular Nim.
Theor. Comput. Sci., 1995

Factorizations of 4-Regular Graphs and Petersen's Theorem.
J. Comb. Theory B, 1995

1994
Fixed elements of infinite trees.
Discret. Math., 1994

1992
Minimal asymmetric graphs of induced length 4.
Graphs Comb., 1992

Edge orbits and edge-deleted subgraphs.
Graphs Comb., 1992

Binary invariants and orientations of graphs.
Discret. Math., 1992

Correspondence between Sylvester, Petersen, Hilbert and Klein on invariants and the factorisation of graphs 1889-1891.
Discret. Math., 1992

Julius Petersen 1839-1910 a biography.
Discret. Math., 1992

Transforming eulerian trails.
Discret. Math., 1992

Julius Petersen annotated bibliography.
Discret. Math., 1992

1991
Clumps, minimal asymmetric graphs, and involutions.
J. Comb. Theory B, 1991

Asymmetrising sets in trees.
Discret. Math., 1991

1990
Focality and graph isomorphism.
Discret. Math., 1990

1989
Paths in bipartite graphs with color-inverting involutions.
J. Graph Theory, 1989

1987
Color-reversal by local complementation.
Discret. Math., 1987

1985
On Maps Related to Halin Separation Lattices.
Eur. J. Comb., 1985

1980
On semigroups of graph endomorphisms.
Discret. Math., 1980

1971
Meshes on 3-connected graphs.
Discret. Math., 1971


  Loading...