(\(1,\lambda\))-embedded graphs and the acyclic edge choosability
type: Item
instance of: scholarly article
zbMATH Open document ID: 1242.05186
DOI: 10.4134/BKMS.2012.49.3.573
author: Xin Zhang
author: Guizhen Liu
author: Jian-Liang Wu
published in: Bulletin of the Korean Mathematical Society
publication date: 2012-06-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1106.4681
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6044478
zbMATH Keywords: (\(1
zbMATH Keywords: \lambda\))-embedded graph
zbMATH Keywords: \(\alpha\)-linear graph
zbMATH Keywords: acyclic edge choosability
MaRDI profile type: Publication
arXiv ID: 1106.4681
OpenAlex ID: W2035658878
Recommended article: On the acyclic choosability of graphs
Recommended article: Q3190529
Recommended article: Girth and λ $\lambda $‐choosability of graphs
Recommended article: Acyclic choosability of graphs with bounded degree
Recommended article: Edge (m,k)-choosability of graphs
Recommended article: Graphs are \((1, \varDelta + 1)\)-choosable
Recommended article: A refinement of choosability of graphs
Recommended article: \(T\)-choosability in graphs
Recommended article: Choosability, edge choosability and total choosability of outerplane graphs
Recommended article: Edge and total choosability of near-outerplanar graphs
title: (\(1,\lambda\))-embedded graphs and the acyclic edge choosability
description: scientific article; zbMATH DE number 6044478