Total matchings and total coverings of threshold graphs

DOI10.1016/0166-218X(94)90216-XzbMath0799.90116MaRDI QIDQ1327237

Feng Sun, Uri N. Peled

Publication date: 15 June 1994

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

zbMATH Keywords

thresholdtotal coveringtotal matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Unnamed Item ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs

Cites Work

• The polytope of degree sequences
• Hamiltonian threshold graphs
• Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
• Ferrers digraphs and threshold graphs
• Extreme degree sequences of simple graphs
• Threshold Sequences
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Total matchings and total coverings of graphs
• Threshold Numbers and Threshold Completions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total matchings and total coverings of threshold graphs