default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Lauri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j32]Yair Caro, Josef Lauri
, Christina Zarb:
The feasibility problem for line graphs. Discret. Appl. Math. 324: 167-180 (2023)- 2022
- [j31]Yair Caro, Adriana Hansberg, Josef Lauri, Christina Zarb:
On Zero-Sum Spanning Trees and Zero-Sum Connectivity. Electron. J. Comb. 29(1) (2022) - [j30]Yair Caro, Josef Lauri, Christina Zarb:
Index of parameters of iterated line graphs. Discret. Math. 345(8): 112920 (2022) - [j29]Yair Caro, Josef Lauri, Christina Zarb:
On small balanceable, strongly-balanceable and omnitonal graphs. Discuss. Math. Graph Theory 42(4): 1219-1235 (2022) - 2020
- [j28]Yair Caro, Josef Lauri, Christina Zarb:
A note on totally-omnitonal graphs. Bull. ICA 89: 34-40 (2020) - 2019
- [j27]Yair Caro, Josef Lauri, Christina Zarb:
Notes on spreads of degrees in graphs. Bull. ICA 85: 79-91 (2019) - [j26]Irene Sciriha, Josef Lauri, John Baptist Gauci, Peter Borg:
Preface: The Second Malta Conference in Graph Theory and Combinatorics. Discret. Appl. Math. 266: 1-2 (2019) - [j25]Josef Lauri, Russell Mizzi, Raffaele Scapellato:
The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability. Discret. Appl. Math. 266: 85-91 (2019) - 2016
- [j24]Yair Caro, Josef Lauri, Christina Zarb:
Selective hypergraph colourings. Discret. Math. 339(4): 1232-1241 (2016) - 2015
- [j23]Yair Caro, Josef Lauri, Christina Zarb:
Independence and matchings in σ-hypergraphs. Australas. J Comb. 63: 12-33 (2015) - [j22]Josef Lauri, Russell Mizzi, Raffaele Scapellato:
Unstable graphs: A fresh outlook via TF-automorphisms. Ars Math. Contemp. 8(1): 115-131 (2015) - [j21]Yair Caro, Josef Lauri, Christina Zarb:
(2, 2)-colourings and clique-free σ-hypergraphs. Discret. Appl. Math. 185: 38-43 (2015) - [j20]Yair Caro, Josef Lauri, Christina Zarb:
Constrained colouring and σ-hypergraphs. Discuss. Math. Graph Theory 35(1): 171-189 (2015) - [j19]Yair Caro, Josef Lauri, Christina Zarb:
The saturation number for the length of degree monotone paths. Discuss. Math. Graph Theory 35(3): 557-569 (2015) - 2014
- [j18]Kevin J. Asciak, Josef Lauri, Wendy J. Myrvold, Virgilio Pannone:
On the edge-reconstruction number of a tree. Australas. J Comb. 60: 169-190 (2014) - [j17]Yair Caro, Josef Lauri:
Non-monochromatic non-rainbow colourings of σ-hypergraphs. Discret. Math. 318: 96-104 (2014) - 2012
- [j16]Mikhail H. Klin, Josef Lauri, Matan Ziv-Av:
Links between two semisymmetric graphs on 112 vertices via association schemes. J. Symb. Comput. 47(10): 1175-1191 (2012) - 2011
- [j15]Josef Lauri, Russell Mizzi, Raffaele Scapellato:
Two-fold automorphisms of graphs. Australas. J Comb. 49: 165-176 (2011) - [j14]Josef Lauri, Cen Jung Tjhai:
Coset graphs for low-density parity check codes: performance on the binary erasure channel. IET Commun. 5(5): 719-727 (2011) - 2010
- [j13]Kevin J. Asciak, M. A. Francalanza, Josef Lauri, Wendy J. Myrvold:
A survey of some open questions in reconstruction numbers. Ars Comb. 97 (2010) - 2003
- [j12]Josef Lauri:
Constructing graphs with several pseudosimilar vertices or edges. Discret. Math. 267(1-3): 197-211 (2003) - 2002
- [j11]Kevin J. Asciak, Josef Lauri:
On Disconnected Graph with Large Reconstruction Number. Ars Comb. 62 (2002) - 1997
- [j10]Josef Lauri:
Pseudosimilarity in Graphs - A Survey. Ars Comb. 46 (1997) - [j9]Josef Lauri:
On a formula for the number of Euler trails for a class of digraphs. Discret. Math. 163(1-3): 307-312 (1997) - 1996
- [j8]Josef Lauri:
Large sets of pseudosimilar vertices. Discret. Math. 155(1-3): 157-160 (1996) - 1994
- [j7]Stanley Fiorini, Josef Lauri:
Preface. Discret. Math. 124(1-3): 1 (1994) - 1987
- [j6]Frank Harary, Josef Lauri:
The class reconstruction number of maximal planar graphs. Graphs Comb. 3(1): 45-53 (1987) - 1983
- [j5]Josef Lauri:
Proof of Harary's conjecture on the reconstruction of trees. Discret. Math. 43(1): 79-90 (1983) - 1982
- [j4]Stanley Fiorini, Josef Lauri:
Edge-reconstruction of 4-connected planar graphs. J. Graph Theory 6(1): 33-42 (1982) - 1981
- [j3]Stanley Fiorini, Josef Lauri:
The reconstruction of maximal planar graphs. I. Recognition. J. Comb. Theory B 30(2): 188-195 (1981) - [j2]Josef Lauri:
The reconstruction of maximal planar graphs II. Reconstruction. J. Comb. Theory B 30(2): 196-214 (1981) - 1979
- [j1]Josef Lauri:
Edge-reconstruction of planar graphs with minimum valency 5. J. Graph Theory 3(3): 269-286 (1979)
Parts in Books or Collections
- 2011
- [p2]Josef Lauri:
Subgraphs as a Measure of Similarity. Structural Analysis of Complex Networks 2011: 319-334 - 2003
- [p1]Alfred V. Aho, Mark Goldberg, Josef Lauri, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graph Representation. Handbook of Graph Theory 2003: 56-125
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
