New structural bounds for ker(G) and core(G)

DOI10.61091/UM128-02MaRDI QIDQ7316053zbMATH OpenFDO

Authors Kevin Pereyra

Publication date 18 August 2026

Published in Utilitas Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/UM128-02

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) 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
• A note on critical independence reductions
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial properties of the family of maximum stable sets of a graph
• Critical independent sets and König-Egerváry graphs
• Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
• Graph theory
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• scientific article; zbMATH DE number 3732108 (Why is no real title available?)
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• 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
• On \(\alpha^{+}\)-stable König-Egerváry graphs
• On the critical difference of almost bipartite graphs
• On the determinant of Kőnig-Egerváry graphs
• On the Kőnig-Egerváry index of a graph
• On the number of vertices belonging to all maximum stable sets of a graph
• Paths, Trees, and Flowers
• Permanental polynomials of 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
• The structure and maximum number of maximum independent sets in trees
• Two more characterizations of König-Egerváry graphs
• Vertices belonging to all critical sets of a graph
• Vertices Belonging to All or to No Maximum Stable Sets of a Graph
• Über kombinatorische Eigenschaften von Matrizen.

This page was built for publication: New structural bounds for \(\operatorname{ker}(G)\) and \(\operatorname{core}(G)\)

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