On oriented 2-factorable graphs

DOI10.1007/BF02936038zbMath1067.05034OpenAlexW2010494882MaRDI QIDQ1767366

Xianqiang Yang

Publication date: 10 March 2005

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02936038

zbMATH Keywords

enumerationoriented graphpermutation voltage assignment

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (4)

Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ On the chromaticity of the 2-degree integral subgraph of \(q\)-trees ⋮ Some results on binding number and fractional perfect matching ⋮ Binding number and Hamiltonian \((g,f)\)-factors in graphs

Cites Work

• Enumeration of labelled multigraphs by degree parities
• Group action for enumerating maps on surfaces
• A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On oriented 2-factorable graphs