Publication:5181716
From MaRDI portal
zbMath0273.05109MaRDI QIDQ5181716
Publication date: 1973
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C99: Graph theory
Related Items
Some sufficient conditions for a graph to be of \(C_f\) 1, A note on the Erdős--Farber--Lovász conjecture, A \(\Delta\)-subgraph condition for a graph to be class 1, Edge-colouring random graphs, Class one graphs, 1-factorizing regular graphs of high degree - an improved bound, Obstructions for regular colorings, Chromatic optimisation: Limitations, objectives, uses, references, The chromatic index of a graph whose core has maximum degree two, Some remarks on good colorations, An extension of bipartite multigraphs, Multigraphs with quasiweak odd cycles, Lower bounds on the cover-index of a graph, A sufficient condition for equitable edge-colourings of simple graphs, Edge coloring regular graphs of high degree, Chromatic index of hypergraphs and Shannon's theorem, Edge-colouring of join graphs, Fractionally total colouring \(G_{n,p}\), Total chromatic number of one kind of join graphs