Regularisable Graphs

DOI10.1016/S0167-5060(08)70493-XMaRDI QIDQ4163564zbMATH OpenOpenAlexFDO

Authors C. Berge

Publication date 1978

Published in Advances in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70493-x

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Cited in

(11)

• Inducing regulation of any digraphs
• Magic graphs, a characterization
• The diagonal hypergraph of a matrix (bipartite graph)
• Pseudo-Hamiltonian-connected graphs
• Crown reductions for the minimum weighted vertex cover problem
• Well-covered graphs and factors
• WELL-COVERED GRAPHS: A SURVEY
• Constructing integer-magic graphs via the combinatorial Nullstellensatz
• A partial refining of the Erdős-Kelly regulation
• The integer-magic spectra and null sets of the Cartesian product of trees
• On factors with given components

This page was built for publication: Regularisable Graphs

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