On the Number of Disjoint Edges in a Graph

DOI10.4153/CJM-1963-012-2MaRDI QIDQ3850553zbMATH OpenOpenAlexFDO

Authors Joseph M. Weinstein

Publication date 1963

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1963-012-2

zbMATH Keywords

topology

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cited in

(9)

• Maximum matching and kernelization of edge dominating set
• On the number of edges of separated multigraphs
• Regular factors of regular graphs
• Matchings in polytopal graphs
• Maximal matchings in graphs with given minimal and maximal degrees
• Extremal problems in graph theory
• Inequalities involving independence domination, f-domination, connected and total f-domination numbers
• On the number of edges of a graph and its complement
• Many disjoint edges in topological graphs

This page was built for publication: On the Number of Disjoint Edges in a Graph

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