scientific article; zbMATH DE number 7283886

zbMath1453.05097MaRDI QIDQ5139700

Tsz Lung Chan

Publication date: 10 December 2020

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p191.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum matchinglongest pathscontractible edges in spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Contractible edges in 3-connected graphs
• The number of contractible edges in 3-connected graphs
• Alternating cycles in edge-partitioned graphs
• Contractible edges in longest cycles in non-Hamiltonian graphs
• Non-contractible edges in a 3-connected graph
• On Forbidden Minors for GF(3)
• Longest cycles in 3-connected graphs contain three contractible edges
• The 3‐connected graphs having a longest cycle containing only three contractible edges
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• Average degree and contractibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: