Circuits containing specified edges

DOI10.1016/0095-8956(77)90072-7zbMATH Open0362.05069OpenAlexW1985580131MaRDI QIDQ1239747FDOQ1239747

Authors: Douglas R. Woodall 

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90072-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• The binding number of a graph and its Anderson number

Cited In (15)

• Circuits through specified edges
• On circuits through five edges
• Cycle traversability for claw-free graphs and polyhedral maps
• Note on circuits containing specified edges
• Girth in graphs
• 2-linked graphs
• On a cycle through a specified linear forest of a graph
• A nine point theorem for 3-connected graphs
• An Improved Algorithm for Finding Cycles Through Elements
• Paths and cycles concerning independence edges
• Clique or hole in claw-free graphs
• Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
• Cycles through specified vertices of a graph
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• Contractible edges in 3-connected graphs

This page was built for publication: Circuits containing specified edges

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