scientific article; zbMATH DE number 3648761

MaRDI QIDQ3207000zbMATH OpenFDO

Authors Peter L. Hammer, Toshihide Ibaraki, P. Simeon

Publication date 1978

zbMATH Keywords

boolean algebradegree sequencesgraph theoryswitching theorythreshold graphsthreshold logicthreshold sequences

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Graph theory (05C99)

Cited in

(12)

• The network flows approach for matrices with given row and column sums
• Adjacency relationships forced by a degree sequence
• On forcibly hereditary P-graphical sequences
• The principal Erdős-Gallai differences of a degree sequence
• Equistable graphs, general partition graphs, triangle graphs, and graph products
• Minimal forbidden sets for degree sequence characterizations
• Neighborhood degree lists of graphs
• Win-win kernelization for degree sequence completion problems
• Graphs and degree sequences. I
• Hereditary unigraphs and Erdős-Gallai equalities
• Once more on matrogenic graphs
• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations

This page was built for publication:

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