On planar graphs arbitrarily decomposable into closed trails

DOI10.1007/s00373-007-0766-4zbMath1158.05050OpenAlexW2088305949MaRDI QIDQ2482349

Zuzana Kocková, Mirko Horňák

Publication date: 16 April 2008

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0766-4

zbMATH Keywords

planar graphclosed trailEven graphgraph arbitrarily decomposable into closed trails

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Unnamed Item ⋮ Find subtrees of specified weight and cycles of specified length in linear time

Cites Work

• Unnamed Item
• Planar graphs without cycles of specific lengths
• Decompositions of pseudographs into closed trails of even sizes
• Packing closed trails into dense graphs.
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Packing Circuits into K_N
• Packing Digraphs with Directed Closed Trails
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails

This page was built for publication: On planar graphs arbitrarily decomposable into closed trails