Subgraphs in vertex neighborhoods of K-free graphs

J. Bang-Jensen, Stephan Brandt

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Resumé

In a K-free graph, the neighborhood of every vertex induces a K-free subgraph. The K-free graphs with the converse property that every induced K-free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r = 3 due to Pach [8].
OriginalsprogEngelsk
TidsskriftJournal of Graph Theory
Vol/bind47
Udgave nummer1
Sider (fra-til)29-38
Antal sider10
ISSN0364-9024
DOI
StatusUdgivet - 2004

Fingeraftryk

Subgraph
Graph in graph theory
Vertex of a graph
Converse

Citer dette

Bang-Jensen, J. ; Brandt, Stephan. / Subgraphs in vertex neighborhoods of K-free graphs. I: Journal of Graph Theory. 2004 ; Bind 47, Nr. 1. s. 29-38.
@article{b9ed0780f19d11db821c000ea68e967b,
title = "Subgraphs in vertex neighborhoods of K-free graphs",
abstract = "In a K-free graph, the neighborhood of every vertex induces a K-free subgraph. The K-free graphs with the converse property that every induced K-free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r = 3 due to Pach [8].",
author = "J. Bang-Jensen and Stephan Brandt",
note = "Copyright 2009 Elsevier B.V., All rights reserved.",
year = "2004",
doi = "10.1002/jgt.20014",
language = "English",
volume = "47",
pages = "29--38",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "JohnWiley & Sons, Inc.",
number = "1",

}

Subgraphs in vertex neighborhoods of K-free graphs. / Bang-Jensen, J.; Brandt, Stephan.

I: Journal of Graph Theory, Bind 47, Nr. 1, 2004, s. 29-38.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - Subgraphs in vertex neighborhoods of K-free graphs

AU - Bang-Jensen, J.

AU - Brandt, Stephan

N1 - Copyright 2009 Elsevier B.V., All rights reserved.

PY - 2004

Y1 - 2004

N2 - In a K-free graph, the neighborhood of every vertex induces a K-free subgraph. The K-free graphs with the converse property that every induced K-free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r = 3 due to Pach [8].

AB - In a K-free graph, the neighborhood of every vertex induces a K-free subgraph. The K-free graphs with the converse property that every induced K-free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r = 3 due to Pach [8].

U2 - 10.1002/jgt.20014

DO - 10.1002/jgt.20014

M3 - Journal article

AN - SCOPUS:4444266093

VL - 47

SP - 29

EP - 38

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -