On some subclasses of interval catch digraphs

DOI10.5614/ejgta.2022.10.1.10zbMath1487.05106OpenAlexW4225254110MaRDI QIDQ5081214

Shamik Ghosh, Sanchita Paul

Publication date: 14 June 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.1.10

zbMATH Keywords

oriented graphtournamentinterval graphproper interval graphinterval catch digraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data
• Forbidden substructure for interval digraphs/bigraphs
• A characterization of interval catch digraphs
• A short proof that `proper = unit'
• Classification using class cover catch digraphs
• Algorithmic graph theory and perfect graphs
• Optimal greedy algorithms for indifference graphs
• A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
• A digraph represented by a family of boxes or spheres
• Interval digraphs: An analogue of interval graphs
• Domination number of an interval catch digraph family and its use for testing uniformity
• Circular‐Arc Bigraphs and Its Subclasses

This page was built for publication: On some subclasses of interval catch digraphs