Fractional matchings and component-factors of (edge-chromatic critical) graphs

03/29/2019
by   Antje Klopp, et al.
0

The paper studies component-factors of graphs which can be characterized in terms of their fractional matching number. These results are used to prove that every edge-chromatic critical graph has a [1,2]-factor. Furthermore, fractional matchings of edge-chromatic critical graphs are studied and some questions are related to Vizing's conjectures on the independence number and 2-factors of edge-chromatic critical graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2023

Graphs with minimum fractional domatic number

The domatic number of a graph is the maximum number of vertex disjoint d...
research
07/09/2018

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs

In this draft we prove an interesting structural property related to the...
research
08/19/2020

Fractional hypergraph isomorphism and fractional invariants

Fractional graph isomorphism is the linear relaxation of an integer prog...
research
04/24/2023

Fractional eternal domination: securely distributing resources across a network

This paper initiates the study of fractional eternal domination in graph...
research
05/17/2022

Coloring circle arrangements: New 4-chromatic planar graphs

Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement gr...
research
03/12/2021

Bears with Hats and Independence Polynomials

Consider the following hat guessing game. A bear sits on each vertex of ...
research
07/03/2020

Fractional Covers of Hypergraphs with Bounded Multi-Intersection

Fractional (hyper-)graph theory is concerned with the specific problems ...

Please sign up or login with your details

Forgot password? Click here to reset