Graph factors modulo k

Research output: Contribution to journalJournal articleResearchpeer-review

385 Downloads (Pure)

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 languageEnglish
JournalJournal of Combinatorial Theory. Series B
Volume106
Pages (from-to)174-177
ISSN0095-8956
DOIs
Publication statusPublished - 2014

Keywords

  • Graph factors modulo k

Fingerprint

Dive into the research topics of 'Graph factors modulo k'. Together they form a unique fingerprint.

Cite this