A note on odd and even factors of undirected graphs

DOI10.1016/0020-0190(80)90004-6zbMath0457.68062OpenAlexW2012137741MaRDI QIDQ1151266

Jürgen Ebert

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90004-6

zbMATH Keywords

depth-first search algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

Parity and disparity subgraphs

Cites Work

• Generalizations of line graphs and applications
• Parallel concepts in graph theory
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A note on odd and even factors of undirected graphs