Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux

DOI10.1016/0095-8956(71)90048-7zbMATH Open0217.02502OpenAlexW2035865139MaRDI QIDQ2546207FDOQ2546207

Authors: Guy Chaty 

Publication date: 1971

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(71)90048-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• A Class Of Abelian Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modules unimodulaires
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Convexity in oriented matroids
• Circuits et arbres de circulation d'un graphe fortement connexe
• On signed digraphs with all cycles negative

This page was built for publication: Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux

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