Decompositions of pseudographs into closed trails of even sizes

DOI10.1016/j.disc.2008.04.024zbMath1218.05123OpenAlexW2086326383MaRDI QIDQ1044920

Mariusz Woźniak, Jakub Przybyło, Sylwia Cichacz

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.024

zbMATH Keywords

irregular coloring numberirregular edge coloringpseudograph decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On planar graphs arbitrarily decomposable into closed trails ⋮ Decomposition of bipartite graphs into closed trails

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-distinguishing edge-colorings of 2-regular graphs
• Packing closed trails into dense graphs.
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Packing Circuits into K_N
• Vertex-distinguishing proper edge-colorings
• Packing Digraphs with Directed Closed Trails
• Decomposition of Complete Bipartite Even Graphs into Closed Trails

This page was built for publication: Decompositions of pseudographs into closed trails of even sizes