Regularisable graphs I
From MaRDI portal
Publication:1251673
DOI10.1016/0012-365X(78)90107-3zbMath0392.05050OpenAlexW4212836086MaRDI QIDQ1251673
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(78)90107-3
Related Items
Node-Balancing by Edge-Increments, Magic graphs, a characterization, A partial refining of the Erdős-Kelly regulation, Matchings and covers in hypergraphs, 1-well-covered graphs revisited, Inducing regulation of any digraphs, Minimal 2-matching-covered graphs, Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling, Ear-decompositions of matching-covered graphs, Bipartite double cover and perfect 2-matching covered graph with its algorithm, Vertices Belonging to All or to No Maximum Stable Sets of a Graph
Cites Work
