scientific article; zbMATH DE number 3428958
From MaRDI portal
Publication:5181716
zbMath0273.05109MaRDI QIDQ5181716
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (44)
An approximation algorithm for maximum packing of 3-edge paths ⋮ Edge-colouring of join graphs ⋮ A \(\Delta\)-subgraph condition for a graph to be class 1 ⋮ Index of parameters of iterated line graphs ⋮ Edge coloring regular graphs of high degree ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ New results relating independence and matchings ⋮ Edge-colouring random graphs ⋮ Class one graphs ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ A note on the Erdős--Farber--Lovász conjecture ⋮ On the size of graphs of class 2 whose cores have maximum degree two ⋮ 1-factorizing regular graphs of high degree - an improved bound ⋮ Overfullness of critical class 2 graphs with a small core degree ⋮ On the chromatic edge stability index of graphs ⋮ The core conjecture of Hilton and Zhao ⋮ Tight bounds on the chromatic edge stability index of graphs ⋮ Overfullness of edge‐critical graphs with small minimal core degree ⋮ How many matchings cover the nodes of a graph? ⋮ Properties, proved and conjectured, of Keller, Mycielski, and queen graphs ⋮ Local neighbor-distinguishing index of graphs ⋮ Some criteria for a graph to be class 1 ⋮ Obstructions for regular colorings ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ Graph edge coloring: a survey ⋮ Improper interval edge colorings of graphs ⋮ The chromatic distinguishing index of certain graphs ⋮ The chromatic index of a graph whose core has maximum degree two ⋮ Polynomial time complexity of edge colouring graphs with bounded colour classes ⋮ Fractionally total colouring \(G_{n,p}\) ⋮ Chromatic index of simple hypergraphs ⋮ Some remarks on good colorations ⋮ An extension of bipartite multigraphs ⋮ Total chromatic number of one kind of join graphs ⋮ Cyclic deficiency of graphs ⋮ Multigraphs with quasiweak odd cycles ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Lower bounds on the cover-index of a graph ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ Decompositions of graphs into trees, forests, and regular subgraphs ⋮ Some sufficient conditions for a graph to be of \(C_f\) 1 ⋮ A sufficient condition for equitable edge-colourings of simple graphs ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2
This page was built for publication:
