On planar graphs arbitrarily decomposable into closed trails

DOI10.1007/S00373-007-0766-4MaRDI QIDQ2482349zbMATH OpenOpenAlexFDO

Authors Mirko Horňák, Zuzana Kocková

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

closed trailEven graphgraph arbitrarily decomposable into closed trailsplanar graph

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)

Recommendations

• On complete tripartite graphs arbitrarily decomposable into closed trails
• Closed trail decompositions of some classes of regular graphs
• Closed trail decompositions on grid graphs
• Decomposition of bipartite graphs into closed trails
• scientific article; zbMATH DE number 5917766
• Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
• Closed trail decompositions of complete equipartite graphs
• On the path separability of planar graphs
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• scientific article; zbMATH DE number 1501958

Cites work

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

Cited in

(4)

• Sparse graphs which decompose into closed trails of arbitrary lengths
• Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight
• Find subtrees of specified weight and cycles of specified length in linear time
• Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles

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

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