scientific article; zbMATH DE number 7107238
From MaRDI portal
Publication:5197729
zbMath1430.05016MaRDI QIDQ5197729
Aysun Yurttas, Sadik Delen, Muge Togan, Ismail Naci Cangul
Publication date: 19 September 2019
Full work available at URL: http://www.mathem.pub.ro/apps/v21/A21-df-ZG35.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (4)
Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Generalized Lucas graphs ⋮ Lucas graphs ⋮ The effect of edge and vertex deletion on omega invariant
Cites Work
- A simple criterion on degree sequences of graphs
- On forcibly connected graphic sequences
- Realizability and uniqueness in graphs
- Extremal problems on components and loops in graphs
- A note on a theorem of Erdős and Gallai
- Reduced criteria for degree sequences
- Neighborhood degree lists of graphs
- A remark concerning graphical sequences
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Unnamed Item
This page was built for publication:
