Christina Zarb

Available identifiers

zbMath Open zarb.christinaMaRDI QIDQ906466

List of research outcomes

Publication	Date of Publication	Type
The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.	2024-11-28	Paper
Flip colouring of graphs	2024-11-04	Paper
Flip colouring of graphs	2023-12-14	Paper
The Feasibility Problem -- the family ${\cal F}$$(G)$ of all induced $G$-free graphs	2023-11-02	Paper
The feasibility problem for line graphs	2022-11-11	Paper
On small balanceable, strongly-balanceable and omnitonal graphs	2022-07-26	Paper
Index of parameters of iterated line graphs	2022-05-27	Paper
On zero-sum spanning trees and zero-sum connectivity	2022-02-01	Paper
A note on totally-omnitonal graphs	2020-07-10	Paper
Hamiltonicity and $\sigma$-hypergraphs	2019-07-22	Paper
Two short proofs of the Perfect Forest Theorem	2019-07-22	Paper
Notes on Spreads of Degrees in Graphs	2019-05-16	Paper
Equating two maximum degrees	2019-02-13	Paper
Degree Monotone Paths and Graph Operations	2017-02-17	Paper
Ramsey numbers for degree monotone paths	2016-12-14	Paper
Selective hypergraph colourings	2016-01-21	Paper
Independence and Matchings in $\sigma$-hypergraphs	2015-11-16	Paper
Degree Monotone Paths	2015-08-05	Paper
The saturation number for the length of degree monotone paths	2015-08-04	Paper
\((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs	2015-04-28	Paper
Constrained colouring and \(\sigma\)-hypergraphs	2015-03-04	Paper

Research outcomes over time

This page was built for person: Christina Zarb