Title

Partial Result On Hadwiger'S Conjecture

Keywords

claw-free; degree sequences; Graph minor

Abstract

Let D = (d1, d2, ⋯, dn) be a graphic sequence with 0 ≤ d1 ≤ d2 ≤ ⋯ ≤ dn. Any simple graph G with D its degree sequence is called a realization of D. Let R[D] denote the set of all realizations of D. We say that D is H-free if no graph in R[D] contains H as an induced subgraph. In this paper, we prove that Hadwiger's Conjecture is true for graphs whose degree sequences are claw-free or K1,3-free.

Publication Date

9-1-2010

Publication Title

Discrete Mathematics, Algorithms and Applications

Volume

2

Issue

3

Number of Pages

413-423

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1142/S1793830910000759

Socpus ID

84930573738 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84930573738

This document is currently not available here.

Share

COinS