4 citations · 16 across the 19 of their papers we have counts for
22 papers
Flip colouring of graphs
Yair Caro, Josef Lauri, Xandru Mifsud +2
It is proved that for integers such that , there exists a red/blue edge-colored graph such that the red degree of every vertex is ,…
The Feasibility Problem -- the family of all induced -free graphs
Yair Caro, Matthew Cassar, Josef Lauri +1
An infinite family of graphs is called feasible if for any pair of integers , , , there is a member such th…
The feasibility problem for line graphs
Yair Caro, Josef Lauri, Christina Zarb
We consider the following feasibility problem: given an integer and an integer such that , does there exist a line graph with…
Index of Parameters of Iterated Line Graphs
Yair Caro, Josef Lauri, Christina Zarb
Let be a prolific graph, that is a finite connected simple graph which is not isomorphic to a cycle nor a path nor the star graph . The line-graph of , denoted by $…
On zero-sum spanning trees and zero-sum connectivity
Yair Caro, Adriana Hansberg, Josef Lauri +1
We consider -colourings of the edges of a graph with colours and in . A subgraph of is said to be a zero-sum…
A note on totally-omnitonal graphs
Yair Caro, Josef Lauri, Christina Zarb
Let the edges of the complete graph be coloured red or blue, and let be a graph with . Then ot(n,G) is defined to be the minimum integer, if it exists, such t…