scientific article; zbMATH DE number 3831999

zbMATH Open0525.05060MaRDI QIDQ3039403FDOQ3039403

Authors: Thomas Zaslavsky, F. R. McMorris 

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

interval orderupper bound graphdouble bound graphconsanguinity graphsedge-clique cover numberstrict upper bound graphvertex-clique cover number

Mathematics Subject Classification ID

Partial orders, general (06A06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cited In (31)

• On upper bound graphs with forbidden subposets
• The numbers of shared upper bounds determine a poset
• Inverting graphs of rectangular matrices
• On equistable, split, CIS, and related classes of graphs
• Posets, clique graphs and their homotopy type
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• On distance two graphs of upper bound graphs
• A note on graphs which have upper irredundance equal to independence
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
• On upper bound graphs with respect to operations on graphs
• On upper bound graphs whose complements are also upper bound graphs
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• On upper bound graphs with edge operations
• Title not available (Why is that?)
• Upper maximal graphs of posets
• On double bound graphs and forbidden subposets
• On double bound graphs and forbidden subposets
• Upper bound multigraphs for posets
• Note on upper bound graphs and forbidden subposets
• A note on chordal bound graphs and posets
• A new perspective on the mereotopology of RCC8
• Competition polysemy
• On strict-double-bound graphs and Cartesian products of paths and cycles
• Posets with interval upper bound graphs
• Some uniqueness results for upper bound graphs
• On strict-double-bound numbers of graphs and cut sets
• The competition-common enemy graph of a digraph
• The solution of two problems on bound polysemy
• Note on strict-double-bound numbers of nearly complete graphs missing some edges
• \(p\)-competition graphs
• Applications of edge coverings by cliques

This page was built for publication:

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