scientific article
From MaRDI portal
zbMath0525.05060MaRDI QIDQ3039403
Thomas Zaslavsky, Fred R. McMorris
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interval orderupper bound graphdouble bound graphconsanguinity graphsedge-clique cover numberstrict upper bound graphvertex-clique cover number
Partial orders, general (06A06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items
The competition-common enemy graph of a digraph, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Upper maximal graphs of posets, On strict-double-bound numbers of graphs and cut sets, Posets with interval upper bound graphs, On equistable, split, CIS, and related classes of graphs, On upper bound graphs whose complements are also upper bound graphs, Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity, Note on strict-double-bound numbers of nearly complete graphs missing some edges, On upper bound graphs with respect to operations on graphs, Posets, clique graphs and their homotopy type, A note on chordal bound graphs and posets, On double bound graphs and forbidden subposets, A note on graphs which have upper irredundance equal to independence, On double bound graphs and forbidden subposets, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, On distance two graphs of upper bound graphs, \(p\)-competition graphs, On upper bound graphs with edge operations, Upper bound multigraphs for posets, Note on upper bound graphs and forbidden subposets, Applications of edge coverings by cliques, Unnamed Item, Competition polysemy, The solution of two problems on bound polysemy, A New Perspective on the Mereotopology of RCC8., The numbers of shared upper bounds determine a poset, Some uniqueness results for upper bound graphs, Inverting graphs of rectangular matrices, On upper bound graphs with forbidden subposets
