Extremal Values of the Interval Number of a Graph

From MaRDI portal
Publication:3964599

DOI10.1137/0601001zbMath0499.05033OpenAlexW1983151348MaRDI QIDQ3964599

Douglas B. West, Jerrold R. Griggs

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/12785/




Related Items

Total interval numbers of complete \(r\)-partite graphsOn an extremal problem concerning the interval number of a graphClique coverings of the edges of a random graphIrredundancy in multiple interval representationsHamiltonian circuits in interval graph generalizationsRecognizing \(d\)-interval graphs and \(d\)-track interval graphsInterval number of special posets and random posetsA short proof of the degree bound for interval numberThe total interval number of a graphOn the unit interval number of a graphSupereulerian graphs: A surveyOn the parameterized complexity of some optimization problems related to multiple-interval graphsThree ways to cover a graphExtremal values of the interval number of a graph. IIExtremal values of the interval number of a graph, IICounting Interval GraphsEdge-intersection graphs of grid paths: the bend-numberInterval numbers of powers of block graphsOn the interval number of random graphsScheduling split intervals with non-uniform demandsRepresentations of graphs and networks (coding, layouts and embeddings)Approximation algorithms for intersection graphsOn the bend-number of planar and outerplanar graphsApproximating the 2-interval pattern problemExtracting constrained 2-interval subsets in 2-interval setsThe total interval number of a tree and the Hamiltonian completion number of its line graphHydras: directed hypergraphs and Horn formulasThe total interval number of a graph. I: Fundamental classesSubtree and substar intersection numbersOptimization problems in multiple subtree graphsOn the complexity of the smallest grammar problem over fixed alphabetsOn the parameterized complexity of multiple-interval graph problemsRecognizing graphs with fixed interval number is NP-completeOn the cubicity of certain graphsThe interval number of a planar graph: Three intervals sufficeSome results about the interval number of a graphA lower bound for the interval number of a graphDetermining the interval number of a triangle-free graphThe interval number of a complete multipartite graphTolerance graphsCovering and coloring problems for relatives of intervalsA note on the interval number of a graphIrrepresentability by multiple intersection, or why the interval number is unbounded



Cites Work