Pages that link to "Item:Q1197981"

The following pages link to An algorithm for fraternal orientation of graphs (Q1197981):

Displaying 13 items.

• Colouring edges with many colours in cycles (Q462927) (← links)
• 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs (Q510581) (← links)
• \(1\)-perfectly orientable graphs and graph products (Q526271) (← links)
• Fraternal augmentations, arrangeability and linear Ramsey numbers (Q1039442) (← links)
• Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
• Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
• A characterization of normal fraternally orientable perfect graphs (Q1357743) (← links)
• \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory (Q1897444) (← links)
• Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
• 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
• Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
• Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
• Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)