Finding balance: split graphs and related classes
From MaRDI portal
Publication:1753048
zbMath1390.05189arXiv1706.03092MaRDI QIDQ1753048
Ann N. Trenk, Karen L. Collins
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.03092
Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Broadcasting in split graphs ⋮ THE DOMINATION GAME ON SPLIT GRAPHS ⋮ Split graphs: combinatorial species and asymptotics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Split graphs and Nordhaus-Gaddum graphs
- Enumeration of bipartite graphs and bipartite blocks
- The enumeration of bipartite graphs
- The strong perfect graph theorem
- Covering a set by subsets
- The splittance of a graph
- Structure and enumeration of \((3+1)\)-free posets
- An Affine Representation for Transversal Geometries
This page was built for publication: Finding balance: split graphs and related classes