On some subclasses of oriented catch digraphs

DOI10.1007/S00373-025-02887-9MaRDI QIDQ7031903zbMATH OpenFDO

Authors Sanchita Paul

Publication date 6 February 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

oriented graphinterval graphtournamentcircular-arc graphcatch digraphinterval catch digraph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 3608050 (Why is no real title available?)
• scientific article; zbMATH DE number 2117210 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• A characterization of interval catch digraphs
• A digraph represented by a family of boxes or spheres
• A structure theorem for the consecutive 1's property
• Algorithmic graph theory and perfect graphs
• Algorithms for interval catch digraphs
• An Efficient Test for Circular-Arc Graphs
• An approximation result for a periodic allocation problem
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Circular‐arc digraphs: A characterization
• Classification using class cover catch digraphs
• Density of a random interval catch digraph family and its use for testing uniformity
• Digraphs
• Domination number of an interval catch digraph family and its use for testing uniformity
• Interval digraphs: An analogue of interval graphs
• Interval graphs and interval orders
• Linear-time recognition of circular-arc graphs
• Matrix characterizations of circular-arc graphs
• On some subclasses of interval catch digraphs
• Representation of a finite graph by a set of intervals on the real line
• SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
• Structure theorems for some circular-arc graphs
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031903)