On forcibly hereditary P-graphical sequences

DOI10.1016/0012-365X(87)90184-1zbMath0614.05047MaRDI QIDQ1820175

A. A. Chernyak, Zhanna A. Chernyak, Regina I. Tyshkevich

Publication date: 1987

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

zbMATH Keywords

semidirect productpseudomorphismsemidecomposable

Mathematics Subject Classification ID

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

Related Items (5)

On vertex-weighted realizations of acyclic and general graphs ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Graphs and degree sequences. I ⋮ Relaxed and approximate graph realizations

Cites Work

• Once more on matrogenic graphs
• Characterizations of strongly chordal graphs
• Structure and recognition of domishold graphs
• The splittance of a graph
• The complexity of comparability graph recognition and coloring
• Trivially perfect graphs
• Solution of the Hamiltonian problem for self-complementary graphs
• Integer-pair sequences with self-complementary realizations
• Graphs and degree sequences: Canonical decomposition
• Threshold Sequences
• A Note on Unigraphic Sequences
• Linear Separation of Dominating Sets in Graphs
• Some Properties of Graphs with Multiple Edges
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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