Jump to content

Talk:Factor-critical graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 00:36, 9 March 2024 (Maintain {{WPBS}}: 1 WikiProject template. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

What is single graph?

[edit]

A graph is also factor-critical if and only if it can be reduced to a single graph ...

What is single graph there? As I understand any graph is single, if we do not talk about two, three, four ... graphs. Jumpow (talk) 21:30, 15 May 2017 (UTC)[reply]

Typo for "single vertex". Fixed now. Thanks for catching this. —David Eppstein (talk) 04:38, 16 May 2017 (UTC)[reply]

is (a,b)-factor-critical

[edit]

...is (a,b)-factor-critical...

Strange definition - a and b are never used. Jumpow (talk) 10:10, 16 May 2017 (UTC)[reply]