Covering the edges with consecutive sets

Document Type

Article

Publication Date

1-1-1991

Abstract

The following question is answered in this note: for which graphs G can the vertices of G be linearly ordered so that all the minimal vertex covers of G are consecutive sets?. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company

Publication Source (Journal or Book title)

Journal of Graph Theory

First Page

559

Last Page

562

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 13
  • Usage
    • Abstract Views: 2
  • Captures
    • Readers: 3
see details

Share

COinS