Graph factors modulo k

Carsten Thomassen

doi:10.1016/j.jctb.2014.01.002

Graph factors modulo k

Carsten Thomassen

Department of Applied Mathematics and Computer Science

King Abdulaziz University

Research output: Contribution to journal › Journal article › Research › peer-review

609 Downloads (Orbit)

Abstract

We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.

Original language	English
Journal	Journal of Combinatorial Theory. Series B
Volume	106
Pages (from-to)	174-177
ISSN	0095-8956
DOIs	https://doi.org/10.1016/j.jctb.2014.01.002
Publication status	Published - 2014

Keywords

Graph factors modulo k

Access to Document

10.1016/j.jctb.2014.01.002

Factors modkAccepted author manuscript, 163 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{5c0475fba68c44b4b3dad2e03469265e,

title = "Graph factors modulo k",

abstract = "We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.",

keywords = "Graph factors modulo k",

author = "Carsten Thomassen",

year = "2014",

doi = "10.1016/j.jctb.2014.01.002",

language = "English",

volume = "106",

pages = "174--177",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press",

}

TY - JOUR

T1 - Graph factors modulo k

AU - Thomassen, Carsten

PY - 2014

Y1 - 2014

N2 - We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.

AB - We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.

KW - Graph factors modulo k

U2 - 10.1016/j.jctb.2014.01.002

DO - 10.1016/j.jctb.2014.01.002

M3 - Journal article

SN - 0095-8956

VL - 106

SP - 174

EP - 177

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

ER -

Graph factors modulo k

Abstract

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this