The SD-KE decomposition through the Larson matching interface

DOI10.61091/JCMCC131-14MaRDI QIDQ7315684zbMATH OpenFDO

Authors Kevin Pereyra

Publication date 18 August 2026

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC131-14

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• A characterization of the graphs in which the transversal number equals the matching number
• Critical independent sets and König-Egerváry graphs
• Forbidden subgraphs and the König-Egerváry property
• scientific article; zbMATH DE number 3222645 (Why is no real title available?)
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Matching theory
• Minimum node covers and 2-bicritical graphs
• Node-weighted graphs having the König-Egerváry property
• On \(\alpha\)-critical edges in König--Egerváry graphs
• Paths, Trees, and Flowers
• Permanental polynomials of graphs
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• Testing for Equality between Maximum Matching and Minimum Node Covering
• The critical independence number and an independence decomposition
• The Determinant of the Adjacency Matrix of a Graph
• Towards a structural characterization of unimodular graphs with a unique perfect matching
• Two more characterizations of König-Egerváry graphs
• TWO THEOREMS IN GRAPH THEORY
• Über kombinatorische Eigenschaften von Matrizen.

This page was built for publication: The SD-KE decomposition through the Larson matching interface

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