Graphs G for which G and G are both semidecomposable

DOI10.1016/0012-365X(87)90134-8zbMATH Open0614.05031OpenAlexW2039502463MaRDI QIDQ1820170FDOQ1820170

Authors: Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno 

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

Recommendations

• scientific article; zbMATH DE number 3922708
• Graph classes characterized both by forbidden subgraphs and degree sequences
• On forcibly connected graphic sequences
• scientific article; zbMATH DE number 932614
• A note on graphic sequences with no realization containing an induced four cycle

zbMATH Keywords

degree sequenceinterval graphchordal graphstrongly chordal graphtrivially perfect graphforcible

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

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

Cited In (2)

• A study on distance in graph complement
• On forcibly hereditary P-graphical sequences

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

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