Reduced graphs of diameter two

DOI10.1002/jgt.3190140109zbMath0699.05037OpenAlexW2114592039MaRDI QIDQ3476835

Hong-Jian Lai

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140109

zbMATH Keywords

collapsible graphsmaximal collapsible subgraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Group connectivity of graphs with diameter at most 2 ⋮ Graphs without spanning closed trails ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ On the line graph of a graph with diameter 2 ⋮ The ubiquitous Petersen graph ⋮ Collapsible graphs and reductions of line graphs ⋮ Supereulerian digraphs with given diameter

Cites Work

• Unnamed Item
• Supereulerian graphs and matchings
• On Spanning and Dominating Circuits in Graphs

This page was built for publication: Reduced graphs of diameter two