scientific article; zbMATH DE number 1424850
From MaRDI portal
zbMATH Open0949.05505MaRDI QIDQ4945873FDOQ4945873
Authors: Jie Ling
Publication date: 26 March 2000
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 279643
- The partition theorem of connected digraphs and its enumerative applications.
- The number of connected graphs with \(k\) cycles on labeled nodes
- Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs
- Enumeration of labeled connected graphs with given order and size
Cited In (19)
- The number of graph homomorphisms between paths and cycles with loops, a problem from Stanley's enumerative combinatorics
- Note on enumeration of labeled split graphs.
- Combinatorial enumeration of subdivisible graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some identities for enumerators of circulant graphs
- Enumeration of labeled outerplanar bicyclic and tricyclic graphs
- Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs
- The partition theorem of connected digraphs and its enumerative applications.
- The number of labeled connected graphs modulo prime powers
- The number of labeled outerplanar \(k\)-cyclic graphs
- Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected
- On the number of labeled outerplanar \(k\)-cycle blocks
- On the number of increasing paths in labeled cycles and stars
- Enumeration of labeled bicyclic and tricyclic Eulerian graphs
- Title not available (Why is that?)
- The number of connected graphs with \(k\) cycles on labeled nodes
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945873)