Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs

DOI10.1016/S0304-0208(08)73488-1MaRDI QIDQ3966179zbMATH OpenOpenAlexFDO

Authors C. Berge

Publication date 1982

Published in Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73488-1

zbMATH Keywords

B-graphsedge criticalmaximum stable setregularizabilitytransversalswell- covered graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cited in

(15)

• Magic graphs, a characterization
• A parameter linked with \(G\)-factors and the binding number
• The roller-coaster conjecture revisited
• On forwarding indices of networks
• 1-well-covered graphs revisited
• On an adjacency property of almost all tournaments
• An introduction to game domination in graphs
• On graphs admitting two disjoint maximum independent sets
• Bounds For Invariants of Edge-Rings
• Regular edges, matchings and Hilbert series
• On 1-König-Egerváry graphs
• Channel allocation revisited through 1-extendability of graphs
• Beyond recognizing well-covered graphs
• Log-concavity of the independence polynomials of \(\mathbf{W}_p\) graphs
• Unimodality of the independence polynomial of G (K_p K_q)

This page was built for publication: Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs

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