Upper maximal graphs of posets

DOI10.1007/s11083-012-9270-4zbMath1282.06003OpenAlexW2030085193MaRDI QIDQ2376910

Yusuf Civan

Publication date: 26 June 2013

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-012-9270-4

zbMATH Keywords

comparability graphchordal graphfinite posetsdouble bound graphupper-bound graphupper-maximal graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorics of partially ordered sets (06A07)

Related Items (2)

On strict-double-bound numbers of caterpillars ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of strongly chordal graphs
• On upper bound graphs whose complements are also upper bound graphs
• On upper bound graphs with respect to operations on graphs
• A note on chordal bound graphs and posets
• On double bound graphs and forbidden subposets

This page was built for publication: Upper maximal graphs of posets