Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs
From MaRDI portal
Publication:3595426
DOI10.1007/978-3-540-70666-3_6zbMath1149.05324arXivmath/0511600OpenAlexW1934784245MaRDI QIDQ3595426
Publication date: 28 August 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511600
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs