On forcibly hereditary P-graphical sequences

DOI10.1016/0012-365X(87)90184-1zbMATH Open0614.05047MaRDI QIDQ1820175FDOQ1820175

Zhanna A. Chernyak, A. A. Chernyak, Regina Iosifovna 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)

Cites Work

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

Cited In (6)

• Relaxed and approximate graph realizations
• Graph realizations: maximum degree in vertex neighborhoods
• Title not available (Why is that?)
• Graphs and degree sequences. I
• On vertex-weighted realizations of acyclic and general graphs
• Forcibly bipartite and acyclic (uni-)graphic sequences

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)