Nearly bipartite graphs (Q1412666): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ervin Gyoeri / rank
 
Normal rank
Property / author
 
Property / author: Vladimir Nikiforov / rank
 
Normal rank
Property / author
 
Property / author: Richard H. Schelp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without short odd cycles are nearly bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: ODD Cycles of Specified Length in Non-Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Arithmetic Progressions of Cycle Lengths in Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00076-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054235532 / rank
 
Normal rank

Latest revision as of 11:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Nearly bipartite graphs
scientific article

    Statements

    Identifiers