Contractible cycles in graphs with girth at least 5

DOI10.1006/JCTB.1998.1844zbMATH Open1029.05083OpenAlexW2093499999MaRDI QIDQ1569031FDOQ1569031

Authors: Yoshimi Egawa 

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1844

Recommendations

• Contractible cycles in graphs with large minimum degree
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• scientific article; zbMATH DE number 568792
• Contractible edges in longest cycles
• Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Nonseparating cycles inK-Connected graphs
• Non-separating induced cycles in graphs
• Distribution of contractible edges in k-connected graphs
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Contractible cycles in graphs with large minimum degree
• Title not available (Why is that?)

Cited In (11)

• Graphs and digraphs with given girth and connectivity
• Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
• The contractible subgraph of 5-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• What is on his mind?
• Note on non-separating and removable cycles in highly connected graphs
• Classification of Hamiltonian cycles of a 3-connected graph which contain five contractible edges
• Nonseparating cycles avoiding specific vertices
• Contractible triples in highly connected graphs
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

This page was built for publication: Contractible cycles in graphs with girth at least 5

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