Methods for the graph realization problem
The graph realization problem seeks an answer to how and under what conditions a graph can be constructed if we know the degrees of its vertices. The problem was widely studied by many authors and in many ways, but there are still new ideas and solutions. In this sense, the paper presents the known...
Main Authors: | Kása Zoltán, Kupán Pál A., Pătcaş Csaba György |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2023-12-01
|
Series: | Acta Universitatis Sapientiae: Informatica |
Subjects: | |
Online Access: | https://doi.org/10.2478/ausi-2023-0017 |
Similar Items
-
AN EFFICIENT CELL SELECTION IN CELLULAR NETWORK WITH BETTER SCALABILITY AND RE-ROUTING
by: KARTHIKEYAN A., et al.
Published: (2014-11-01) -
Solutions to problems about potentially Ks,t-bigraphic pair
by: Yin Jian-Hua, et al.
Published: (2022-06-01) -
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
by: Guo Ji-Yun, et al.
Published: (2017-02-01) -
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
by: Kai Wang
Published: (2021-03-01) -
On l-reconstructibility of degree list of graphs
by: Rajab Ali Borzooei, et al.
Published: (2024-01-01)