On forcibly hereditary P-graphical sequences

DOI10.1016/0012-365X(87)90184-1MaRDI QIDQ1820175zbMATH OpenFDO

Authors A. A. Chernyak, Zhanna A. Chernyak, Regina Iosifovna Tyshkevich

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)90184-1

zbMATH Keywords

semidirect productpseudomorphismsemidecomposable

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• Graphs G for which G and \(\bar G\) are both semidecomposable
• Decomposition of graphical sequences and unigraphs
• A property of adjacency matrices of realizations of pair sequences
• The six bidecomposable graphs
• scientific article; zbMATH DE number 4012650

Cites work

• scientific article; zbMATH DE number 3831996 (Why is no real title available?)
• scientific article; zbMATH DE number 3648761 (Why is no real title available?)
• scientific article; zbMATH DE number 3922708 (Why is no real title available?)
• scientific article; zbMATH DE number 3977053 (Why is no real title available?)
• scientific article; zbMATH DE number 3652386 (Why is no real title available?)
• scientific article; zbMATH DE number 3674138 (Why is no real title available?)
• scientific article; zbMATH DE number 3677890 (Why is no real title available?)
• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 3754758 (Why is no real title available?)
• scientific article; zbMATH DE number 3760202 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• A Note on Unigraphic Sequences
• Characterizations of strongly chordal graphs
• Graphs and degree sequences: Canonical decomposition
• Integer-pair sequences with self-complementary realizations
• Linear Separation of Dominating Sets in Graphs
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
• Once more on matrogenic graphs
• Solution of the Hamiltonian problem for self-complementary graphs
• Some Properties of Graphs with Multiple Edges
• Structure and recognition of domishold graphs
• The complexity of comparability graph recognition and coloring
• The splittance of a graph
• Threshold Sequences
• Trivially perfect graphs

Cited in

(8)

• Relaxed and approximate graph realizations
• On bipartite graph realizations of a single degree sequence
• Graph realizations: maximum degree in vertex neighborhoods
• scientific article; zbMATH DE number 3922708 (Why is no real title available?)
• Graphs and degree sequences. I
• On vertex-weighted realizations of acyclic and general graphs
• Realizing graphs with cut constraints
• Forcibly bipartite and acyclic (uni-)graphic sequences

This page was built for publication: On forcibly hereditary P-graphical sequences

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