A note on the potential function of an arbitrary graph H
From MaRDI portal
Publication:5081262
DOI10.2298/FIL2011759YzbMath1499.05105MaRDI QIDQ5081262
Publication date: 14 June 2022
Published in: Filomat (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Graphic sequences with a realization containing a union of cliques
- Graphic sequences with a realization containing a generalized friendship graph
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- An extremal problem on the potentially \(P_k\)-graphic sequences
- On the potential function of an arbitrary graph \(H\)
- The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- 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
- A General Lower Bound for Potentially H-Graphic Sequences
This page was built for publication: A note on the potential function of an arbitrary graph H