Construction of (, k)-critical graphs

zbMATH Open1256.05168MaRDI QIDQ2906842FDOQ2906842

Michitaka Furuya

Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p053.pdf

Recommendations

• On connected \((\gamma,k)\)-critical graphs
• On local edge connected domination critical graphs
• A generalization of domination critical graphs
• Maximal \(3\)-\(\gamma\)-vertex-critical graphs
• Connected domination critical graphs with cut vertices

zbMATH Keywords

domination number\((2,k)\)-critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (8)

• A characterization of domination weak bicritical graphs with large diameter
• Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
• Haj�s constructions of critical graphs
• Construction of crossing-critical graphs
• Title not available (Why is that?)
• The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs
• Critical graphs without triangles: an optimum density construction
• Upper bounds on the diameter of domination dot-critical graphs with given connectivity

This page was built for publication: Construction of (\(\gamma, k\))-critical graphs

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