Critical star multigraphs
From MaRDI portal
DOI10.1007/BF01788095zbMATH Open0619.05023DBLPjournals/gc/ChetwyndH86OpenAlexW2094682092WikidataQ59233701 ScholiaQ59233701MaRDI QIDQ1089350FDOQ1089350
Authors: Amanda G. Chetwynd, A. J. W. Hilton
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788095
Recommendations
- A note on vertex-criticality with respect to edge-coloring
- Some remarks on a paper of Chetwynd and Hilton on critical star multigraphs
- Graphs which are vertex‐critical with respect to the edge‐chromatic class
- Graphs which are vertex-critical with respect to the edge-chromatic number
- Edge covered critical multigraphs
Cites Work
- Title not available (Why is that?)
- On edge-colorings of graphs.
- The chromatic index of graphs with a spanning star
- Title not available (Why is that?)
- Regular Graphs of High Degree are 1-Factorizable
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- Title not available (Why is that?)
- Title not available (Why is that?)
- The chromatic index of graphs of even order with many edges
- Title not available (Why is that?)
- A note concerning the chromatic index of multigraphs
- Title not available (Why is that?)
- Definitions of criticality with respect to edge-coloring
- Graphs which are vertex‐critical with respect to the edge‐chromatic class
Cited In (19)
- Recent results on the total chromatic number
- Characterization of split graphs with at most four distinct eigenvalues
- Reverse class critical multigraphs
- The Hall number, the Hall index, and the total Hall number of a graph
- Recent progress on edge-colouring graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Vizing's coloring algorithm and the fan number
- Embedding partial extended triple systems and totally symmetric quasigroups
- A note concerning the chromatic index of multigraphs
- Two conjectures on edge-colouring
- Graphs which are vertex-critical with respect to the edge-chromatic number
- Title not available (Why is that?)
- A theorem in edge colouring
- On Vizing's bound for the chromatic index of a multigraph
- Stars and Bonds in Crossing-Critical Graphs
- Graphs which are vertex‐critical with respect to the edge‐chromatic class
- The chromatic index of multigraphs that are nearly full
- Vertex-splitting and chromatic index critical graphs
- Edge-colouring of join graphs
This page was built for publication: Critical star multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089350)