Premium
Orthogonal factorizations of graphs
Author(s) -
Feng Haodi,
Liu Guizhen
Publication year - 2002
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10048
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , factorization , discrete mathematics , algorithm
Let G be a graph with vertex set V ( G ) and edge set E ( G ). Let k 1 , k 2 ,…, k m be positive integers. It is proved in this study that every [0, k 1 +…+ k m − m +1]‐graph G has a [0, k i ] 1 m ‐factorization orthogonal to any given subgraph H with m edges. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 267–276, 2002
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom