Set graphs. IV. Further connections with claw-freeness
From MaRDI portal
Publication:400530
DOI10.1016/j.dam.2014.05.011zbMath1298.05147OpenAlexW2031259408MaRDI QIDQ400530
Alexandru I. Tomescu, Martin Milanič
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.011
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic enumeration of extensional acyclic digraphs
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
- Graphs without large apples and the maximum weight independent set problem
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
- On independent vertex sets in subclasses of apple-free graphs
- Distance-hereditary graphs
- The strong perfect graph conjecture for pan-free graphs
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
- Ranking, unranking and random generation of extensional acyclic digraphs
- Counting extensional acyclic digraphs
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
- {log}: A language for programming in logic with finite sets
- Hamiltonian results inK1,3-free graphs
- Graphs with 1-Factors
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Computational Logic and Set Theory
- Set Graphs. V. On representing graphs as membership digraphs
- The Number of Full Sets with n Elements
- Independent Sets of Maximum Weight in Apple-Free Graphs
This page was built for publication: Set graphs. IV. Further connections with claw-freeness
