scientific article; zbMATH DE number 6683596

MaRDI QIDQ2959975zbMATH OpenFDO

Authors Alan Guo

Publication date 10 February 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAO0139

zbMATH Keywords

cyclic sieving phenomenonLagrange inversionnon-crossing connected graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Cyclic sieving phenomenon in non-crossing connected graphs
• Cyclic sieving for two families of non-crossing graphs
• The cyclic sieving phenomenon on circular Dyck paths
• scientific article; zbMATH DE number 568792
• The cyclic sieving phenomenon for non-crossing forests
• Cyclic separability in graphs
• Non-separating even cycles in highly connected graphs
• Cyclic sieving phenomena on annular noncrossing permutations
• Nonseparable graphs with a given number of cycles
• Vertex disjoint non-separating cycles in graphs

Cited in

(9)

• Enumeration of noncrossing trees on a circle
• A bijective proof of an identity for noncrossing graphs
• The cyclic sieving phenomenon
• Decomposition and merging algorithms for noncrossing forests
• Thrall's problem: cyclic sieving, necklaces, and branching rules
• Cyclic sieving for two families of non-crossing graphs
• A decomposition algorithm for noncrossing trees
• The cyclic sieving phenomenon for non-crossing forests
• Cyclic sieving phenomenon in non-crossing connected graphs

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 Q2959975)