Regularisable graphs I
From MaRDI portal
Publication:1251673
Cites work
Cited in
(11)- Inducing regulation of any digraphs
- Minimal 2-matching-covered graphs
- Ear-decompositions of matching-covered graphs
- Magic graphs, a characterization
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
- Matchings and covers in hypergraphs
- 1-well-covered graphs revisited
- Bipartite double cover and perfect 2-matching covered graph with its algorithm
- Node-balancing by edge-increments
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- A partial refining of the Erdős-Kelly regulation
This page was built for publication: Regularisable graphs I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251673)