Browsing by Author Lauri, Josef

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 40 to 74 of 74 < previous 
Issue DateTitleAuthor(s)
1999On a determinant formula for enumerating Euler trails in a class of digraphsLauri, Josef
1997On a formula for the number of Euler trails for a class of digraphsLauri, Josef
2002On disconnected graph with large reconstruction numberAsciak, Kevin J.; Lauri, Josef
1988On pseudosimilarity in graphsLauri, Josef; Marino, M. C.
2020On small balanceable, strongly-balanceable and omnitonal graphsCaro, Yair; Lauri, Josef; Zarb, Christina
2018On stopping rules and the sex ratio at birthGrech, Victor E.; James, William H.; Lauri, Josef
1988On the class-reconstruction number of treesHarary, Frank; Lauri, Josef
2014On the edge-reconstruction number of a treeAsciak, Kevin J.; Lauri, Josef; Myrvold, Wendy; Pannone, Virgilio
2011On the edge-reconstruction number of disconnected graphsAsciak, Kevin J.; Lauri, Josef
1982On the edge-reconstruction of graphs which triangulate surfacesFiorini, Stanley; Lauri, Josef
2022On zero-sum spanning trees and zero-sum connectivityCaro, Yair; Hansberg, Adriana; Lauri, Josef; Zarb, Christina
2010Patient-oriented personality traits of first-year pharmacy studentsLauri, Mary Anne; Cordina, Maria; Lauri, Josef
2015Personality traits of pharmacy and medical students throughout their course of studiesCordina, Maria; Lauri, Mary Anne; Buttigieg, Raphael; Lauri, Josef
1988-06Platform : news and views : no. 1Lauri, Josef; Pirotta, Joseph; Killick, Jean
2012Polynomial reconstruction for certain subclasses of disconnected graphsCoates, Jane; Lauri, Josef; Sciriha, Irene
2019Preface : the second Malta conference in graph theory and combinatoricsSciriha, Irene; Lauri, Josef; Baptist Gauci, John; Borg, Peter
1983Proof of Harary's conjecture on the reconstruction of treesLauri, Josef
1997Pseudosimilarity in graphs : a surveyLauri, Josef
1981The reconstruction of maximal planar graphs I. recognitionFiorini, S.; Lauri, Josef
1981The reconstruction of maximal planar graphs II. ReconstructionLauri, Josef
2015The saturation number for the length of degree monotone pathsCaro, Yair; Lauri, Josef; Zarb, Christina
2016Selective hypergraph colouringsCaro, Yair; Lauri, Josef; Zarb, Christina
2005Social representations of organ donors and non‐donorsLauri, Mary Anne; Lauri, Josef
2009Social representations of religion of Maltese university studentsLauri, Mary Anne; Lauri, Josef; Duriez, Bart
2010A survey of some open questions in reconstruction numbersAsciak, Kevin J.; Francalanza, M. A.; Lauri, Josef; Myrvold, W.
2016Topics in graph automorphisms and reconstructionLauri, Josef; Scapellato, Raffaele
2017Two short proofs of the Perfect Forest TheoremCaro, Yair; Lauri, Josef; Zarb, Christina
2011Two-fold automorphisms of graphsLauri, Josef; Mizzi, R.; Scapellato, R.
2004Two-fold orbital digraphs and other constructionsLauri, Josef; Mizzi, Russell; Scapellato, R.
2017Two-fold orbitalsLauri, Josef; Mizzi, Russell; Scapellato, Raffaele
2014Unstable graphs : a fresh outlook via TF-automorphismsLauri, Josef; Mizzi, Russell; Scapellato, Raffaele
2024Using schur rings to produce GRRs for dihedral groupsEbejer, Jonathan; Lauri, Josef
1993Vertex-deleted and edge-deleted subgraphsLauri, Josef
2012Voloshin colourings of mixed hypergraphs derived from graphsLauri, Josef; Gionfriddo, Lucia
2019WASP (write a scientific paper) : using correspondence analysis to investigate qualitative data elicited through photographsLauri, Mary Anne; Lauri, Josef