Josef Lauri - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2023

The feasibility problem for line graphsYair Caro, Josef Lauri, Christina Zarb. DAM, 324:167-180, 2023. [doi]

2022

On Zero-Sum Spanning Trees and Zero-Sum ConnectivityYair Caro, Adriana Hansberg, Josef Lauri, Christina Zarb. combinatorics, 29(1), 2022. [doi]

Index of parameters of iterated line graphsYair Caro, Josef Lauri, Christina Zarb. DM, 345(8):112920, 2022. [doi]

On small balanceable, strongly-balanceable and omnitonal graphsYair Caro, Josef Lauri, Christina Zarb. dmgt, 42(4):1219-1235, 2022. [doi]

2020

A note on totally-omnitonal graphsYair Caro, Josef Lauri, Christina Zarb. bullica, 89:34-40, 2020. [doi]

2019

Notes on spreads of degrees in graphsYair Caro, Josef Lauri, Christina Zarb. bullica, 85:79-91, 2019. [doi]

The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instabilityJosef Lauri, Russell Mizzi, Raffaele Scapellato. DAM, 266:85-91, 2019. [doi]

Preface: The Second Malta Conference in Graph Theory and CombinatoricsIrene Sciriha, Josef Lauri, John Baptist Gauci, Peter Borg. DAM, 266:1-2, 2019. [doi]

2016

Selective hypergraph colouringsYair Caro, Josef Lauri, Christina Zarb. DM, 339(4):1232-1241, 2016. [doi]

2015

(2, 2)-colourings and clique-free σ-hypergraphsYair Caro, Josef Lauri, Christina Zarb. DAM, 185:38-43, 2015. [doi]

Independence and matchings in σ-hypergraphsYair Caro, Josef Lauri, Christina Zarb. ajc, 63:12-33, 2015. [doi]

The saturation number for the length of degree monotone pathsYair Caro, Josef Lauri, Christina Zarb. dmgt, 35(3):557-569, 2015. [doi]

Constrained colouring and σ-hypergraphsYair Caro, Josef Lauri, Christina Zarb. dmgt, 35(1):171-189, 2015. [doi]

Unstable graphs: A fresh outlook via TF-automorphismsJosef Lauri, Russell Mizzi, Raffaele Scapellato. arsmc, 8(1):115-131, 2015. [doi]

2014

On the edge-reconstruction number of a treeKevin J. Asciak, Josef Lauri, Wendy Myrvold, Virgilio Pannone. ajc, 60:169-190, 2014. [doi]

Non-monochromatic non-rainbow colourings of σ-hypergraphsYair Caro, Josef Lauri. DM, 318:96-104, 2014. [doi]

2012

Links between two semisymmetric graphs on 112 vertices via association schemesMikhail H. Klin, Josef Lauri, Matan Ziv-Av. JSC, 47(10):1175-1191, 2012. [doi]

2011

Coset graphs for low-density parity check codes: performance on the binary erasure channelJosef Lauri, Cen J. Tjhai. iet-com, 5(5):719-727, 2011. [doi]

Two-fold automorphisms of graphsJosef Lauri, Russell Mizzi, Raffaele Scapellato. ajc, 49:165-176, 2011. [doi]

Subgraphs as a Measure of SimilarityJosef Lauri. In Matthias Dehmer, editor, Structural Analysis of Complex Networks. pages 319-334, Birkhäuser / Springer, 2011. [doi]

2010

A survey of some open questions in reconstruction numbersKevin J. Asciak, M. A. Francalanza, Josef Lauri, W. Myrvold. arscom, 97, 2010.

2003

Graph RepresentationAlfred V. Aho, Mark Goldberg, Josef Lauri, Richard B. Borie, R. Gary Parker, Craig A. Tovey. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 56-125, Chapman & Hall / Taylor & Francis, 2003. [doi]

Constructing graphs with several pseudosimilar vertices or edgesJosef Lauri. DM, 267(1-3):197-211, 2003. [doi]

2002

On Disconnected Graph with Large Reconstruction NumberKevin J. Asciak, Josef Lauri. arscom, 62, 2002.

1997

On a formula for the number of Euler trails for a class of digraphsJosef Lauri. DM, 163(1-3):307-312, 1997. [doi]

Pseudosimilarity in Graphs - A SurveyJosef Lauri. arscom, 46, 1997.

1996

Large sets of pseudosimilar verticesJosef Lauri. DM, 155(1-3):157-160, 1996. [doi]

1994

PrefaceS. Fiorini, Josef Lauri. DM, 124(1-3):1, 1994. [doi]

1987

The class reconstruction number of maximal planar graphsFrank Harary, Josef Lauri. gc, 3(1):45-53, 1987. [doi]

1983

Proof of Harary s conjecture on the reconstruction of treesJosef Lauri. DM, 43(1):79-90, 1983. [doi]

1982

Edge-reconstruction of 4-connected planar graphsS. Fiorini, Josef Lauri. jgt, 6(1):33-42, 1982. [doi]

1981

The reconstruction of maximal planar graphs. I. RecognitionS. Fiorini, Josef Lauri. JCT, 30(2):188-195, 1981. [doi]

The reconstruction of maximal planar graphs II. ReconstructionJosef Lauri. JCT, 30(2):196-214, 1981. [doi]

1979

Edge-reconstruction of planar graphs with minimum valency 5Josef Lauri. jgt, 3(3):269-286, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL