Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

W. Sean Kennedy, Conor Meagher, Bruce A. Reed

Open source

DOI
10.1016/j.endm.2009.07.008
Published
2009-08
Container
Electronic Notes in Discrete Mathematics
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/j.endm.2009.07.008,
  title = {Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time},
  author = {W. Sean Kennedy and Conor Meagher and Bruce A. Reed},
  year = {2009},
  journal = {Electronic Notes in Discrete Mathematics},
  doi = {10.1016/j.endm.2009.07.008},
  url = {https://doi.org/10.1016/j.endm.2009.07.008}
}

RIS

TY  - JOUR
TI  - Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time
AU  - W. Sean Kennedy
AU  - Conor Meagher
AU  - Bruce A. Reed
PY  - 2009
JO  - Electronic Notes in Discrete Mathematics
DO  - 10.1016/j.endm.2009.07.008
UR  - https://doi.org/10.1016/j.endm.2009.07.008
ER  - 

APA

Kennedy, W. S., Meagher, C., & Reed, B. A. (2009). Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2009.07.008

Source records