Covers, matchings and odd cycles of a graph

DOI10.1016/0012-365X(75)90022-9zbMATH Open0311.05129MaRDI QIDQ1219306FDOQ1219306

Authors: R. H. Jeurissen 

Publication date: 1975

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites Work

• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel concepts in graph theory
• TWO THEOREMS IN GRAPH THEORY
• An Algorithm for a Minimum Cover of a Graph
• Title not available (Why is that?)
• Covers and packings in a family of sets
• Maximum internally stable sets of a graph
• Title not available (Why is that?)
• On the critical lines of a graph

This page was built for publication: Covers, matchings and odd cycles of a graph

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