Triangle-free projective-planar graphs with diameter two: domination and characterization
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma kant Sahoo,, Sagnik Sen

TL;DR
This paper characterizes all triangle-free projective-planar graphs with diameter two and explores applications including calculating clique number analogues for complex colored mixed graphs.
Contribution
It provides a complete characterization of triangle-free projective-planar graphs with diameter two, extending Plesník's planar graph results to the projective plane.
Findings
Characterization of all such graphs with diameter two
Application to colored mixed graphs and clique number analogues
Extension of planar graph diameter results to projective-planar graphs
Abstract
In 1975, Plesn\'ik characterized all triangle-free planar graphs as having a diameter . We characterize all triangle-free projective-planar graphs having a diameter and discuss some applications. In particular, the main result is applied to calculate the analogue of clique numbers for graphs, namely, colored mixed graphs, having different types of arcs and edges.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
