Reduced graphs of diameter two

DOI10.1002/JGT.3190140109MaRDI QIDQ3476835zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 165093
• Properties of Catlin's reduced graphs and supereulerian graphs
• Collapsible graphs and reductions of line graphs
• Collapsible graphs and matchings
• A reduction method to find spanning Eulerian subgraphs

Cites work

• Graph theory with applications
• On Spanning and Dominating Circuits in Graphs
• Supereulerian graphs and matchings

Cited in

(14)

• Collapsible graphs and reductions of line graphs
• Graphs without spanning closed trails
• The ubiquitous Petersen graph
• The generalized S-graphs of diameter 3
• Diameters of graphs on reduced words of \(12\) and \(21\)-inflations
• On s-Hamiltonicity of net-free line graphs
• On the line graph of a graph with diameter 2
• Supereulerian digraphs with given diameter
• Group connectivity and group colorings of graphs --- a survey
• Fan-type conditions for collapsible graphs
• Collapsible graphs and matchings
• Graphs with supereulerian width 3 and small diameters
• Essentially 3-edge-connected reduced graph of diameter three
• Group connectivity of graphs with diameter at most 2

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

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