Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
From MaRDI portal
Publication:3966179
DOI10.1016/S0304-0208(08)73488-1zbMath0501.05056OpenAlexW4242692448MaRDI QIDQ3966179
No author found.
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (9)
On graphs admitting two disjoint maximum independent sets ⋮ Magic graphs, a characterization ⋮ The roller-coaster conjecture revisited ⋮ On an adjacency property of almost all tournaments ⋮ A parameter linked with \(G\)-factors and the binding number ⋮ Bounds For Invariants of Edge-Rings ⋮ An Introduction to Game Domination in Graphs ⋮ 1-well-covered graphs revisited ⋮ On forwarding indices of networks
This page was built for publication: Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
