On fans in multigraphs

DOI10.1002/JGT.20135MaRDI QIDQ5469028zbMATH OpenOpenAlexFDO

Authors D. Cariolaro

Publication date 16 May 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20135

zbMATH Keywords

critical edgecritical graphedge cloringfan digraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Some consequences of a theorem on fans
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• A new tool for proving Vizing's theorem
• A generalization of edge-coloring in graphs
• A new method of proving theorems on chromatic index

Cites work

• A Theorem on Coloring the Lines of a Network
• Cybernetics
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)

Cited in

(11)

• A theorem in edge colouring
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• On fan-crossing graphs
• Fan-extensions in fragile matroids
• Compatibility fans for graphical nested complexes
• Small embeddings for partial 5-cycle systems
• Fans are not c-determined
• A combined logarithmic bound on the chromatic index of multigraphs
• Local version of Vizing's theorem for multigraphs
• An adjacency Lemma for critical multigraphs
• Some consequences of a theorem on fans

This page was built for publication: On fans in multigraphs

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