A short proof of the degree bound for interval number
type: Item
instance of: scholarly article
title: A short proof of the degree bound for interval number
zbMATH Open document ID: 0663.05040
DOI: 10.1016/0012-365X(89)90276-8
author: Douglas B. West
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex v is represented by at most \(\lfloor (d(v)+1\rfloor\) intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most \(\lceil (d(w)+1)\rceil\) intervals.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4083665
zbMATH Keywords: interval representation
MaRDI profile type: Publication
cites work: Extremal Values of the Interval Number of a Graph
Recommended article: Q4337507
Recommended article: Short proofs for interval digraphs
Recommended article: A short proof of a theorem on degree sets of graphs
Recommended article: A lower bound for the interval number of a graph
Recommended article: Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
Recommended article: Some results about the interval number of a graph
Recommended article: Short interval results for a class of integers
Recommended article: A Short Proof of a Theorem of Erdos and Mordell
Recommended article: A Short Proof of the Erdos-Mordell Theorem
Recommended article: An Interval of Computably Enumerable Isolating Degrees
description: scientific article; zbMATH DE number 4083665