Recognizing vertex intersection graphs of paths on bounded degree trees
type: Item
instance of: scholarly article
title: Recognizing vertex intersection graphs of paths on bounded degree trees
zbMATH Open document ID: 1300.05190
published in: Discrete Applied Mathematics
publication date: 2014-09-12T00:00:00Z
full work available at URL: http://sedici.unlp.edu.ar/handle/10915/85561
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6344071
zbMATH Keywords: intersection graphs
zbMATH Keywords: VPT graphs
zbMATH Keywords: representations on trees
zbMATH Keywords: recognition problems
zbMATH Keywords: chromatic number
author: L. Alcón
author: M. Gutierrez
author: M. P. Mazzoleni
MaRDI profile type: Publication
OpenAlex ID: W2017788065
cites work: Q3941433
cites work: Graph Classes: A Survey
cites work: The strong perfect graph theorem
cites work: What Is between Chordal and Weakly Chordal Graphs?
cites work: Tree representations of graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A recognition algorithm for the intersection graphs of paths in trees
cites work: Edge and vertex intersection of paths in a tree
cites work: The \(k\)-edge intersection graphs of paths in a tree
cites work: Equivalences and the complete hierarchy of intersection graphs of paths in a tree
cites work: Representing edge intersection graphs of paths on degree 4 trees
cites work: Intersection models of weakly chordal graphs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Tolerance intersection graphs on binary trees with constant tolerance 3
cites work: Constant tolerance intersection graphs of subtrees of a tree
cites work: Reducibility among Combinatorial Problems
cites work: Intersection graphs of paths in a tree
cites work: Connectivity threshold for random chordal graphs
cites work: A faster algorithm to recognize undirected path graphs
cites work: Triangulated edge intersection graphs of paths in a tree
DOI: 10.1016/J.DAM.2013.08.004
description: scientific article; zbMATH DE number 6344071