Minimum number of vertices of almost 3-regular graphs with given deficiency

zbMATH Open1275.05033MaRDI QIDQ2858951FDOQ2858951

Authors: Indriati Nurul Hidayah, Purwanto 

Publication date: 5 November 2013

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/7581.htm

Recommendations

• scientific article; zbMATH DE number 2104811
• On minors of graphs with at least 3n −4 edges
• A note on minimally 3-connected graphs
• Minimally 3-connected graphs
• A note on vertices contained in the minimum dominating set of a graph with minimum degree three
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
• 3-minimal triangle-free graphs
• Minimally 3-restricted edge connected graphs
• scientific article; zbMATH DE number 3166040
• Graphs of diameter 3 with the minimum number of edges

zbMATH Keywords

deficiencynumber of verticesalmost 3-regular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On deficiency problems for graphs
• Title not available (Why is that?)
• Three notes on trees with deficiency one
• Minimum order of a graph with given deficiency and either minimum or maximum degree

This page was built for publication: Minimum number of vertices of almost 3-regular graphs with given deficiency

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