On the excessive \([m]\)-index of a tree

DOI10.1016/j.dam.2013.08.014zbMath1300.05062arXiv1301.1521OpenAlexW1982683179MaRDI QIDQ741745

Giuseppe Mazzuoccolo

Publication date: 12 September 2014

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

Full work available at URL: https://arxiv.org/abs/1301.1521

zbMATH Keywords

treesmatchingsexcessive indexcaterpillars

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ Excessive \([l, m\)-factorizations]

Cites Work

• Unnamed Item
• Unnamed Item
• Excessive factorizations of bipartite multigraphs
• Graphs of arbitrary excessive class
• 1-factor covers of regular graphs
• Covering graphs with matchings of fixed size
• Matching theory
• On parsimonious edge-colouring of graphs with maximum degree three
• The excessive [3-index of all graphs]
• Covering cubic graphs with matchings of large size
• The equivalence of two conjectures of Berge and Fulkerson
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• An Upper Bound for the Excessive Index of an r‐Graph
• The Solution of a Timetabling Problem
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: On the excessive \([m]\)-index of a tree