The excessive [3]-index of all graphs

zbMath1186.05049MaRDI QIDQ2380288

David Cariolaro, Hung-Lin Fu

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227939

zbMATH Keywords

matchingedge coloringexcessive \([m\)-factorization]excessive \([m\)-index]

Mathematics Subject Classification ID

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

Related Items (7)

Excessive factorizations of bipartite multigraphs ⋮ On excessive index of certain networks ⋮ Excessive index for mesh derived networks ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ On the excessive \([m\)-index of a tree] ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ Excessive \([l, m\)-factorizations]

This page was built for publication: The excessive [3]-index of all graphs