Covers, matchings and odd cycles of a graph

DOI10.1016/0012-365X(75)90022-9MaRDI QIDQ1219306zbMATH OpenFDO

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

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3291000 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• An Algorithm for a Minimum Cover of a Graph
• Covers and packings in a family of sets
• Maximum internally stable sets of a graph
• On the critical lines of a graph
• Parallel concepts in graph theory
• Paths, Trees, and Flowers
• TWO THEOREMS IN GRAPH THEORY

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)