A short proof of the degree bound for interval number

DOI10.1016/0012-365X(89)90276-8MaRDI QIDQ1114708zbMATH OpenFDO

Authors Douglas B. West

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval representation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 1011262
• Short proofs for interval digraphs
• A short proof of a theorem on degree sets of graphs
• A lower bound for the interval number of a graph
• Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
• Some results about the interval number of a graph
• Short interval results for a class of integers
• A Short Proof of a Theorem of Erdos and Mordell
• A Short Proof of the Erdos-Mordell Theorem
• An Interval of Computably Enumerable Isolating Degrees

Cites work

• Extremal Values of the Interval Number of a Graph

Cited in

(7)

• Subtree and substar intersection numbers
• Interval numbers of powers of block graphs
• On a complementary interval graph with the lowest max-degree
• Three ways to cover a graph
• An improved edge bound on the interval number of a graph
• Recognizing d-interval graphs and d-track interval graphs
• On the interval number of special graphs

This page was built for publication: A short proof of the degree bound for interval number

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