The author explores the broadcast independence number of oriented circulant graphs, focusing on independent broadcasts and their properties.
The authors investigate the minimum acyclic number and maximum dichromatic number in oriented triangle-free graphs of a given order, providing bounds and constructions to support their findings.
The author explores the relationship between (n, m)-chromatic numbers and sparsity parameters in graphs, revealing new insights and bounds.
The authors demonstrate the existence of dominating and face-hitting sets in plane graphs, highlighting the necessity of specific conditions for their conclusions.
Recognizing relating edges is NP-complete for graphs without cycles of length 6.