The degree sequences of a graph with restrictions
<p>Two finite sequences <em>s</em><sub>1 </sub>and <em>s</em><sub>2</sub> of nonnegative integers are called bigraphical if there exists a bipartite graph <em>G</em> with partite sets <em>V</em><sub>1</sub> and...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2021-12-01
|
| Series: | Indonesian Journal of Combinatorics |
| Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/142 |