On potentially K₆-C₅ graphic sequences
From MaRDI portal
Publication:2895362
zbMATH Open1264.05035arXiv0812.4861MaRDI QIDQ2895362FDOQ2895362
Authors: Zhenghua Xu, Chunhui Lai
Publication date: 2 July 2012
Published in: Utilitas Mathematica (Search for Journal in Brave)
Abstract: For given a graph , a graphic sequence is said to be potentially -graphic if there exists a realization of containing as a subgraph. In this paper, we characterize the potentially -graphic sequences.
Full work available at URL: https://arxiv.org/abs/0812.4861
Recommendations
Cited In (14)
- On potentially \(H\)-graphic sequences
- A characterization on potentially \(K_6-E(K_3)\)-graphic sequences.
- A characterization on potentially \(K_6-C_4\)-graphic sequences.
- On potentially \(_kC_l\)-graphic sequences
- On potentially H-graphic sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On potentially \(C_{2,6}\)-graphic sequences.
- A characterization on potentially \(K_{2,5}\)-graphic sequences.
- On potentially \(K_{1,4}+e\)-graphic sequences
- On potentially 3-regular graph graphic sequences
- Potentially \(H\)-graphic sequences
This page was built for publication: On potentially \(K_6-C_5\) graphic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895362)