Orientable quadrangulation of graphs

MaRDI QIDQ2757130zbMATH OpenFDO

Authors Yuanqiu Huang

Publication date 4 August 2002

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

Bipartite graphgenussurfaceup-embeddability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

This note shows a counteraxample to the denial of the conjecture that a \(d\)-regular bipartite graph of order \(2n\) has a quadrangulation if, and only if, \(nd\equiv 0\pmod 4\). Here, each face of a quadrangulation is restricted to a \(4\)-gon, i.e., a circuit of \(4\) edges. The conjecture was posed by \textit{T. Pisanski} [J. Graph Theory 4, 31-42 (1980; Zbl 0432.05024)[. The method used here is based on \textit{Y. Huang} and \textit{Y. Liu} [Sci. China, Ser. A 41, 498-504 (1998; Zbl 0946.05035)].

Recommendations

• Spanning bipartite quadrangulations of even triangulations
• Orientable quadrilateral embedding of products of graphs
• On quadrilaterals and cycle covers in a bipartite graph.
• Minimal quadrangulations of orientable surfaces
• The quadrangulation conjecture for orientable surfaces

Cited in

(4)

• A remark on embedded bipartite graphs
• Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions
• Four-valent oriented graphs of biquasiprimitive type
• scientific article; zbMATH DE number 7610225 (Why is no real title available?)

This page was built for publication: Orientable quadrangulation of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757130)