Critical star multigraphs
From MaRDI portal
Publication:1089350
DOI10.1007/BF01788095zbMath0619.05023OpenAlexW2094682092WikidataQ59233701 ScholiaQ59233701MaRDI QIDQ1089350
Anthony J. W. Hilton, Amanda G. Chetwynd
Publication date: 1986
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788095
Related Items
Edge-colouring of join graphs ⋮ Recent progress on edge-colouring graphs ⋮ Vertex-splitting and chromatic index critical graphs ⋮ Embedding partial extended triple systems and totally symmetric quasigroups ⋮ Two conjectures on edge-colouring ⋮ Graphs which are vertex-critical with respect to the edge-chromatic number ⋮ The chromatic index of multigraphs that are nearly full ⋮ A note concerning the chromatic index of multigraphs ⋮ Recent results on the total chromatic number ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ Vizing's coloring algorithm and the fan number ⋮ Graphs which are vertex‐critical with respect to the edge‐chromatic class ⋮ Unnamed Item ⋮ A theorem in edge colouring ⋮ The Hall number, the Hall index, and the total Hall number of a graph ⋮ On Vizing's bound for the chromatic index of a multigraph ⋮ Characterization of split graphs with at most four distinct eigenvalues
Cites Work
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- A note concerning the chromatic index of multigraphs
- The chromatic index of graphs with a spanning star
- On edge-colorings of graphs.
- Definitions of criticality with respect to edge-coloring
- Regular Graphs of High Degree are 1-Factorizable
- The chromatic index of graphs of even order with many edges
- Graphs which are vertex‐critical with respect to the edge‐chromatic class
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
