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 31 to 50 of 111 < previous next >

Issue Date	Title	Author(s)
2018	Fake news detector	Bondin, Luca
2018	Fast algorithms for indices of nested split graphs approximating real complex networks	Sciriha, Irene; Briffa, Johann A.; Debono, Mark
2023	Feasibility and forbidden subgraphs	Cassar, Matthew (2023)
2023	The feasibility problem : the family F(G) of all 2 induced G-free graphs	Caro, Yair; Cassar, Matthew; Lauri, Josef; Zarb, Christina
2023	The feasibility problem for line graphs	Caro, Yair; Lauri, Josef; Zarb, Christina
2023	Flip colouring of graphs	Caro, Yair; Lauri, Josef; Mifsud, Xandru; Yuster, Raphael; Zarb, Christina
2024	Further applications of schur rings to produce GRRs for dihedral groups	Ebejer, Jonathan; Lauri, Josef
2006	G.U.L. : Graph Utility Library	Spiteri, Clint (2006)
1987	Graph reconstruction - some techniques and new problems	Lauri, Josef
2019	Graph theory results of independence, domination, covering and Turán type	Fenech, Kurt
1996	Graphs and their spectra	Sciriha, Irene
1996	Graphs with maximum singularity	Gutman, Ivan; Sciriha, Irene
2023	Graph‐based food recommendations	Attard, George (2023)
2015	Independence and matchings in σ-hypergraphs	Caro, Yair; Lauri, Josef; Zarb, Christina
2018	Independent sets of graphs	Grech, Wayne
2022	Index of parameters of iterated line graphs	Caro, Yair; Lauri, Josef; Zarb, Christina
2019	Irregular independence and irregular domination	Borg, Peter; Caro, Yair; Fenech, Kurt
2022	Isolation of k-cliques II	Borg, Peter; Fenech, Kurt; Kaemawichanurat, Pawaton
2005	k → 1 functions between graphs	Gauci, John Baptist
2021	The labelling of graphs through colouring	Camilleri, Samantha (2021)

Showing results 31 to 50 of 111 < previous next >