On distance two graphs of upper bound graphs

DOI10.1016/J.DISC.2010.05.019MaRDI QIDQ712252zbMATH OpenOpenAlexFDO

Authors Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya

Publication date 28 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.05.019

zbMATH Keywords

distance two graphsSplit graphsupper bound graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• 2-upper bound graphs and numbers
• \(2\)-upper bound graphs of posets.
• Note on upper bound graphs with forbidden subgraphs
• On upper bound graphs whose complements are also upper bound graphs
• scientific article; zbMATH DE number 1034030

Cites work

• scientific article; zbMATH DE number 3831999 (Why is no real title available?)
• scientific article; zbMATH DE number 4093496 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• On upper bound graphs whose complements are also upper bound graphs

Cited in

(2)

• 2-upper bound graphs and numbers
• \(2\)-upper bound graphs of posets.

This page was built for publication: On distance two graphs of upper bound graphs

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