The following pages link to (Q3039403):
Displaying 27 items.
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- Note on strict-double-bound numbers of nearly complete graphs missing some edges (Q658101) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- On distance two graphs of upper bound graphs (Q712252) (← links)
- Upper bound multigraphs for posets (Q757442) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Inverting graphs of rectangular matrices (Q797599) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- On upper bound graphs with edge operations (Q1012449) (← links)
- Note on upper bound graphs and forbidden subposets (Q1025563) (← links)
- Some uniqueness results for upper bound graphs (Q1053714) (← links)
- The competition-common enemy graph of a digraph (Q1086581) (← links)
- Posets with interval upper bound graphs (Q1104348) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- On upper bound graphs whose complements are also upper bound graphs (Q1377711) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- Competition polysemy (Q1827753) (← links)
- The solution of two problems on bound polysemy (Q1827754) (← links)
- On upper bound graphs with respect to operations on graphs (Q1978708) (← links)
- Upper maximal graphs of posets (Q2376910) (← links)
- Posets, clique graphs and their homotopy type (Q2462344) (← links)
- A note on chordal bound graphs and posets (Q2470467) (← links)
- The numbers of shared upper bounds determine a poset (Q2572468) (← links)
- On upper bound graphs with forbidden subposets (Q3439316) (← links)
- A New Perspective on the Mereotopology of RCC8. (Q4580234) (← links)
- On strict-double-bound numbers of graphs and cut sets (Q5061697) (← links)
