Enumeration of point-determining graphs
From MaRDI portal
Publication:618313
DOI10.1016/j.jcta.2010.03.009zbMath1238.05136arXiv0705.0042MaRDI QIDQ618313
Publication date: 14 January 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.0042
combinatorial species; graphical enumeration; graphs without endpoints; point-determining; superimposition of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The enumeration of bipartite graphs
- On the number of bi-colored graphs
- Enumeration of unlabelled mating graphs
- Complement reducible graphs
- Une théorie combinatoire des séries formelles
- Enumerative aspects of certain subclasses of perfect graphs
- Point determination in graphs
- On theories with a combinatorial definition of 'equivalence'
- Labelled graphs with vertices of degree at least three
- Enumeration of Bicolourable Graphs
- Enumeration of smooth labelled graphs
- Enumeration of non-separable graphs