Eulerian partial duals of plane graphs
| Autor: | Xian’an Jin, Metrose Metsidik |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
010102 general mathematics
Comparability graph Eulerian path 0102 computer and information sciences 01 natural sciences 1-planar graph Planar graph law.invention Combinatorics symbols.namesake 010201 computation theory & mathematics Dual graph law TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Partial k-tree Medial graph Line graph symbols Discrete Mathematics and Combinatorics Geometry and Topology 0101 mathematics MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Journal of Graph Theory. 87:509-515 |
| ISSN: | 0364-9024 |
| Popis: | In the paper Combinatorica 33(2) (2013) 231–252, Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of oriented circuits in its medial graph. An open problem posed in their paper is the characterization of Eulerian partial duals of plane graphs. In this article, we solve this problem by considering half-edge orientations of medial graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text