1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges

Mengyao Dai, Xin Zhang

Source record

Source: Crossref

Published: Feb 1, 2027

DOI: 10.1016/j.disc.2026.115440

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.