On strict-double-bound numbers of graphs and cut sets

DOI10.5614/ejgta.2021.9.2.16zbMath1482.05241OpenAlexW3206911696WikidataQ114014167 ScholiaQ114014167MaRDI QIDQ5061697

Shin-Ichiro Tashiro, Kenjiro Ogawa, Morimasa Tsuchiya, Kazutaka Ikeda, Satoshi Tagusari

Publication date: 14 March 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.16

zbMATH Keywords

chordal graphstrict-double-bound graphstrict-double-bound numbercut-set

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The competition-common enemy graph of a digraph
• Posets with interval upper bound graphs
• Note on strict-double-bound graphs and numbers
• Triangulated graphs and the elimination process
• ON STRICT-DOUBLE-BOUND NUMBERS OF COMPLETE PSEUDO-REGULAR TREES
• The leafage of a chordal graph
• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs