Towards a characterization of leaf powers by clique arrangements (Q343767): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
Towards a Characterization of Leaf Powers by Clique Arrangements
description / endescription / en
scientific article
scientific article; zbMATH DE number 6406452
Property / title
 
Towards a Characterization of Leaf Powers by Clique Arrangements (English)
Property / title: Towards a Characterization of Leaf Powers by Clique Arrangements (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1435.05096 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-46078-8_30 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
20 February 2015
Timestamp+2015-02-20T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 20 February 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6406452 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1646789727 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2512078600 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.1425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood subtree tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ptolemaic Graphs and Interval Graphs Are Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted directed path graphs are leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Powers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring pairwise compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear-time recognition of 4-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,ℓ)-Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k- Versus (k + 1)-Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-Steiner Root Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error compensation in leaf power problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting clique trees and computing perfect elimination schemes in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique-separator graph for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks about leaf roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tree representation of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank

Latest revision as of 00:53, 13 July 2024

scientific article; zbMATH DE number 6406452
  • Towards a Characterization of Leaf Powers by Clique Arrangements
Language Label Description Also known as
English
Towards a characterization of leaf powers by clique arrangements
scientific article; zbMATH DE number 6406452
  • Towards a Characterization of Leaf Powers by Clique Arrangements

Statements

Towards a characterization of leaf powers by clique arrangements (English)
0 references
Towards a Characterization of Leaf Powers by Clique Arrangements (English)
0 references
0 references
0 references
0 references
0 references
29 November 2016
0 references
20 February 2015
0 references
0 references
0 references
0 references
0 references
0 references
0 references
leaf powers
0 references
clique arrangement
0 references
strongly chordal graphs
0 references
nest graphs
0 references
0 references
0 references
0 references
0 references