Primarily orientable graphs
Houmem Belkhechine
TL;DR
This paper characterizes primarily orientable graphs, identifying those that can be oriented to produce a prime, indecomposable graph under modular decomposition.
Contribution
It provides a complete characterization of primarily orientable graphs, advancing understanding of their structural properties.
Findings
Characterization of primarily orientable graphs
Conditions for orienting graphs to be prime
Insights into modular decomposition of graphs
Abstract
A graph is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.
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 · Graph Labeling and Dimension Problems · Rings, Modules, and Algebras