REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
From MaRDI portal
Publication:5076249
DOI10.17654/DM018040505zbMATH Open1499.05224MaRDI QIDQ5076249FDOQ5076249
Authors: Suechao Li, Bing Wei, Xuechao Li 
Publication date: 16 May 2022
Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Planar graphs of maximum degree seven are Class I
- The size of edge chromatic critical graphs with maximum degree 6
- Title not available (Why is that?)
- Every planar graph with maximum degree 7 is of class 1
- The average degree of an edge-chromatic critical graph
- Edge coloring of graphs with small maximum degrees
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
- Bounds for the Independence Number of Critical Graphs
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
- The independence number of an edge-chromatic critical graph
This page was built for publication: REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076249)
