OAR@UM: Browsing OAR@UM

Browsing by Subject Graph theory

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:

Showing results 84 to 103 of 110 < previous next >

Issue Date	Title	Author(s)
2018	A quantum perspective on random walks on graphs	Callus, Elena (2018)
1981	The reconstruction of maximal planar graphs I. recognition	Fiorini, S.; Lauri, Josef
1981	The reconstruction of maximal planar graphs II. Reconstruction	Lauri, Josef
2020	A reduction procedure for the Colin de Verdière number of a graph	Mitchell, Lon; Sciriha, Irene
2015	The saturation number for the length of degree monotone paths	Caro, Yair; Lauri, Josef; Zarb, Christina
2020	Schur rings : some theory and applications to graphical regular representations	Ebejer, Jonathan
2022	Security in graphs	Fenech, Kyra (2022)
2016	Selective hypergraph colourings	Caro, Yair; Lauri, Josef; Zarb, Christina
2022	Signed graphs, two-graphs and Seidel matrices	Fava, Leanne (2022)
2020	Signed nut graphs	Bašić, Nino; Fowler, Patrick W.; Pisanski, Tomaz; Sciriha, Irene
2024	Some snarks are worse than others	Máčajová, Edita; Mazzuoccolo, Giuseppe; Mkrtchyan, Vahan; Zerafa, Jean Paul
2020	Spectral graph theory : from practice to theory	Farrugia, Alexander
2009	The spectrum of the adjacency matrix of graphs and regular subgraphs	Zerafa, Cheryl (2009)
2010	A survey of some open questions in reconstruction numbers	Asciak, Kevin J.; Francalanza, M. A.; Lauri, Josef; Myrvold, W.
2016	Topics in graph automorphisms and reconstruction	Lauri, Josef; Scapellato, Raffaele
2017	Two short proofs of the Perfect Forest Theorem	Caro, Yair; Lauri, Josef; Zarb, Christina
2011	Two-fold automorphisms of graphs	Lauri, Josef; Mizzi, R.; Scapellato, R.
2003	Two-fold orbital digraphs and other constructions	Mizzi, Russell
2004	Two-fold orbital digraphs and other constructions	Lauri, Josef; Mizzi, Russell; Scapellato, R.
2019	Two-graphs and NSSDs : an algebraic approach	Sciriha, Irene; Collins, Luke

Showing results 84 to 103 of 110 < previous next >