Light subgraphs in graphs with average degree at most four

DOI10.1016/J.DISC.2016.04.020zbMATH Open1339.05265arXiv1512.02496OpenAlexW2189902912MaRDI QIDQ294570FDOQ294570

Publication date: 16 June 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: A graph

H

is said to be {em light} in a family

m a t h f r a k G

of graphs if at least one member of

m a t h f r a k G

contains a copy of

H

and there exists an integer

l a m b d a (H, m a t h f r a k G)

such that each member

G

of

m a t h f r a k G

with a copy of

H

also has a copy

K

of

H

such that

d e g_{G} (v) l e q l a m b d a (H, m a t h f r a k G)

for all

v i n V (K)

. In this paper, we study the light graphs in the class of graphs with small average degree, including the plane graphs with some restrictions on girth.

Full work available at URL: https://arxiv.org/abs/1512.02496

Recommendations

zbMATH Keywords

average degree planar graph light subgraphs normal plane maps

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Cites Work

Cited In (3)

This page was built for publication: Light subgraphs in graphs with average degree at most four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294570)