Threshold characterization of graphs with dilworth number two

DOI10.1002/JGT.3190090207MaRDI QIDQ3708054zbMATH OpenOpenAlexFDO

Authors C. Benzaken, Peter L. Hammer, Dominique De Werra

Publication date 1985

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190090207

zbMATH Keywords

Dilworth numberthreshold signed graphvicinal preorder

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Box-threshold graphs
• Multithreshold graphs
• Some properties of 2-threshold graphs
• Double-threshold permutation graphs
• Split graphs of Dilworth number 2

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Split Graphs Having Dilworth Number Two

Cited in

(19)

• Probe threshold and probe trivially perfect graphs
• Perfectness and Dilworth number
• Split graphs of Dilworth number 2
• Intersection graphs of halflines and halfplanes
• A note on perfect orders
• On dynamic threshold graphs and related classes
• Double-threshold permutation graphs
• On pairwise compatibility graphs having Dilworth number k
• On pairwise compatibility graphs having Dilworth number two
• The simple graph threshold number (r,s,a,t) when r 3 is odd and a 2 is even
• Fully dynamically maintaining minimal integral separator for threshold and difference graphs
• Box-threshold graphs
• scientific article; zbMATH DE number 4125434 (Why is no real title available?)
• Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two
• Difference graphs
• Linear-time recognition of double-threshold graphs
• Bipartite bithreshold graphs
• A bound for the Dilworth number
• Vicinal orders of trees

This page was built for publication: Threshold characterization of graphs with dilworth number two

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