Graphs G for which G and \(\bar G\) are both semidecomposable

DOI10.1016/0012-365X(87)90134-8zbMath0614.05031OpenAlexW2039502463MaRDI QIDQ1820170

Kiyoshi Ando, Hirobumi Mizuno, Yoshimi Egawa

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90134-8

zbMATH Keywords

chordal graphinterval graphdegree sequencestrongly chordal graphtrivially perfect graphforcible

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

A study on distance in graph complement

Cites Work

• Edge-colorability of graph bundles
• The six bidecomposable graphs

This page was built for publication: Graphs G for which G and \(\bar G\) are both semidecomposable