Labelled Graphs with Small Vertex Degrees and P-Recursiveness
From MaRDI portal
Publication:3705482
Recommendations
- On the \(L(p,1)\)-labelling of graphs
- scientific article; zbMATH DE number 5763163
- Labelled graphs with vertices of degree at least three
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
- scientific article; zbMATH DE number 5026592
- Small graphs and hypergraphs of given degree and girth
- Small vertex-transitive graphs of given degree and girth
- Recursive constructions of small regular graphs of given degree and girth
- L(p, q)-labeling of planar graphs with small girth
- On \(L(d,1)\)-labelings of graphs
Cites work
- scientific article; zbMATH DE number 3877221 (Why is no real title available?)
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- Differentiably finite power series
- Number of labeled 4-regular graphs
- The Enumeration of Locally Restricted Graphs (II)
- The Hammond Series of a Symmetric Function and Its Application to P-Recursiveness
- Theory and Application of Plane Partitions. Part 2
Cited in
(6)- Symmetric functions and P-recursiveness
- Small cancellation labellings of some infinite graphs and applications
- Counting on matrices
- Weighted first-order model counting in the two-variable fragment with counting quantifiers
- Starter labelling of \(k\)-windmill graphs with small defects
- Enumeration of cubic graphs by inclusion-exclusion
This page was built for publication: Labelled Graphs with Small Vertex Degrees and P-Recursiveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705482)