Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs

DOI10.1007/S00373-020-02191-8zbMATH Open1466.05162OpenAlexW3032014821WikidataQ123336270 ScholiaQ123336270MaRDI QIDQ2227997FDOQ2227997

Authors: Qing Ji, Mingda Liu, Xiaodong Chen 

Publication date: 16 February 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02191-8

Recommendations

• Vizing's 2-factor conjecture involving large maximum degree
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture

zbMATH Keywords

2-factorindependence numbercritical and almost regular graphsGrünewald and Steffen construction

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Hamiltonian cycles in critical graphs with large maximum degree
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
• Title not available (Why is that?)
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Title not available (Why is that?)
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Vizing's 2-factor conjecture involving large maximum degree
• Approximating Vizing's independence number conjecture
• Title not available (Why is that?)
• Chromatic-index-critical graphs of even order
• Independence number of edge‐chromatic critical graphs

Cited In (3)

• Vizing's 2-factor conjecture involving large maximum degree
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions
• Even factors in edge-chromatic-critical graphs with a small number of divalent vertices

This page was built for publication: Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227997)