Threshold dimension of split-permutation graphs

MaRDI QIDQ3003880zbMATH OpenFDO

Authors Mónica Villanueva, Carmen Z. Ortiz

Publication date 31 May 2011

zbMATH Keywords

certifying algorithmspermutation graphsplit graphthreshold graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Split permutation graphs
• scientific article; zbMATH DE number 622475
• The lexicographic method for the threshold cover problem
• Bounds on Threshold Dimension and Disjoint Threshold Coverings
• scientific article; zbMATH DE number 1263242

Cited in

(9)

• Split dimension of graphs
• Split permutation graphs
• Bounds on Threshold Dimension and Disjoint Threshold Coverings
• Threshold Dimension of Graphs
• scientific article; zbMATH DE number 3970804 (Why is no real title available?)
• scientific article; zbMATH DE number 622475 (Why is no real title available?)
• The lexicographic method for the threshold cover problem
• Permutations représentatives d'un graphe à seuil
• The relationship between the threshold dimension of split graphs and various dimensional parameters

This page was built for publication: Threshold dimension of split-permutation graphs

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