scientific article; zbMATH DE number 3480616

MaRDI QIDQ4063170zbMATH OpenFDO

Authors François Jaeger

Publication date 1974

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited in

(13)

• The k-conversion number of regular graphs
• To be or not to be Yutsis: algorithms for the decision problem
• A feedback vertex set of 2-degenerate graphs
• Graph structural properties of non-Yutsis graphs allowing fast recognition
• On the maximum induced forests of a connected cubic graph without triangles
• Some remarks on Jaeger's dual-hamiltonian conjecture
• A lower bound on the \(k\)-conversion number of graphs of maximum degree \(k+1\)
• Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
• Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
• The integrity of a cubic graph
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
• To be or not to be Yutsis
• Induced forests in cubic graphs

This page was built for publication:

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