The integrity of a cubic graph
type: Item
instance of: scholarly article
title: The integrity of a cubic graph
zbMATH Open document ID: 1069.90018
author: Andrew Vince
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 2083779
zbMATH Keywords: integrity
zbMATH Keywords: network reliability
MaRDI profile type: Publication
full work available at URL: j.dam.2003.07.002
OpenAlex ID: W2036329881
cites work: Eigenvalues and expanders
cites work: Large induced degenerate subgraphs
cites work: Large induced forests in sparse graphs
cites work: Integrity of regular graphs and integrity graphs
cites work: A survey of integrity
cites work: Q3128894
cites work: Q3789603
cites work: Q3781769
cites work: Decycling cubes and grids
cites work: Decycling graphs
cites work: Q3682518
cites work: Lower Bounds For Induced Forests in Cubic Graphs
cites work: Cubic Ramanujan graphs
cites work: Q5691133
cites work: Q3775581
cites work: Q3490019
cites work: Q4063170
cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
cites work: On locating minimum feedback vertex sets
cites work: A linear-time algorithm for the weighted feedback vertex problem on interval graphs
cites work: Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
cites work: Ramanujan graphs
cites work: Almost exact minimum feedback vertex set in meshes and butterflies
cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
cites work: On feedback vertex sets and nonseparating independent sets in cubic graphs
cites work: On the maximum induced forests of a connected cubic graph without triangles
DOI: 10.1016/J.DAM.2003.07.002
description: scientific article; zbMATH DE number 2083779