Extremal problems on components and loops in graphs
type: Item
instance of: scholarly article
title: Extremal problems on components and loops in graphs
zbMATH Open document ID: 1411.05136
author: Sadik Delen
author: Ismail Naci Cangül
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 7043595
zbMATH Keywords: graph characteristic
zbMATH Keywords: connectedness
zbMATH Keywords: cyclic graph
zbMATH Keywords: acyclic graph
zbMATH Keywords: degree sequence
MaRDI profile type: Publication
full work available at URL: s10114-018-8086-6
OpenAlex ID: W2898078977
cites work: Realizability and uniqueness in graphs
cites work: Neighborhood degree lists of graphs
cites work: On forcibly connected graphic sequences
cites work: Q4583393
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: A remark on the existence of finite graphs
cites work: A short constructive proof of the Erdős-Gallai characterization of graphic lists
cites work: Graphs and degree sequences. I
cites work: Contributions to the theory of graphic sequences
Wikidata QID: Q129002782
DOI: 10.1007/S10114-018-8086-6
published in: Acta Mathematica Sinica, English Series
Recommended article: Q5543308
Recommended article: Q5728132
Recommended article: On some extremal problems in graph theory
Recommended article: Q4056041
Recommended article: Q5610919
Recommended article: Extremal problems for cycles in graphs
Recommended article: Q4677950
Recommended article: On extremal problems of graphs and generalized graphs
Recommended article: Q4028500
Recommended article: Q5753977
description: scientific article; zbMATH DE number 7043595