scientific article; zbMATH DE number 3266380
From MaRDI portal
Publication:5550921
zbMath0166.19601MaRDI QIDQ5550921
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Unnamed Item ⋮ An improvement to the Hilton-Zhao vertex-splitting conjecture ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ Unnamed Item ⋮ Zero-divisor graphs and total coloring conjecture ⋮ On generalisations of the AVD conjecture to digraphs ⋮ Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ The terminal-pairability problem in complete bipartite graphs ⋮ Chromatic index of dense quasirandom graphs ⋮ Even factors in edge-chromatic-critical graphs with a small number of divalent vertices ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Overfullness of critical class 2 graphs with a small core degree ⋮ Double Vizing fans in critical class two graphs ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Independence number of edge‐chromatic critical graphs ⋮ On the chromatic edge stability index of graphs ⋮ Chromatic number and subtrees of graphs ⋮ Terminal-pairability in complete bipartite graphs ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Total difference chromatic numbers of regular infinite graphs ⋮ Tashkinov-trees: an annotated proof ⋮ Overfullness of edge‐critical graphs with small minimal core degree ⋮ Improving upper bounds for the distinguishing index ⋮ A note on chromatic number of (cap, even hole)-free graphs ⋮ On sum edge-coloring of regular, bipartite and split graphs ⋮ A new tool for proving Vizing's theorem ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ A larger family of planar graphs that satisfy the total coloring conjecture ⋮ Approximating Vizing's independence number conjecture ⋮ Nordhaus-Gaddum type inequalities for the distinguishing index ⋮ Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
This page was built for publication:
