New proof of adjacency lemmas of edge critical graphs

zbMATH Open1440.05091MaRDI QIDQ3178812FDOQ3178812

Authors: Shuchao Li, Wei Bing, Xuechao Li 

Publication date: 20 December 2016

Recommendations

• An extension of Vizing's adjacency lemma of edge chromatic critical graphs
• A new upper bound for the independence number of edge chromatic critical graphs
• A conclusion on the properties of edge-coloring critical graphs
• An adjacency Lemma for critical multigraphs
• The independence number of an edge-chromatic critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Alternative proofs of three theorems of Chetwynd and Hilton
• A theorem in edge colouring
• A conclusion on the properties of edge-coloring critical graphs
• An adjacency Lemma for critical multigraphs

This page was built for publication: New proof of adjacency lemmas of edge critical graphs

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